Given a Binary Tree and 2 nodes value n1 and n2 ** **, your task is to find the lowest common ancestor of the two nodes . You are required to complete the function **LCA** **. **You should not read any input from stdin/console. There are multiple test cases. For each test case, this method will be called individually.

**Input:**

The task is to complete the method **LCA **which takes 3 arguments, root of the Tree and two nodes value **n1** and **n2 **. The struct node has a data part which stores the data, pointer to left child and pointer to right child.

There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should return the node which is the least common ancestor of the two nodes n1 and n2 .

**Constraints:**

1 <=T<= 30

1 <=Number of nodes<= 100

1 <=Data of a node<= 1000

**Example:**

**Input**

1

2

1 2 L 1 3 R

2 3

**Output **

1

In above example there is one test case which represent a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 2 and right child of 1 is 3.

**Note:**The **Input/Ouput** format and **Example** given are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

All Is Well | 138 |

ioan | 123 |

praveen2809 | 106 |

Diplav Srivastava | 100 |

user2100 | 90 |

Lam Ngoc Pham | 405 |

Divvya Sinha | 352 |

All Is Well | 327 |

skull tone | 310 |

KM SUNITA | 301 |

akhayrutdinov | 3792 |

sanjay05 | 3366 |

Jasleen Kaur 2 | 2012 |

Michael Riegger | 1996 |

Quandray | 1923 |