|All-time Popular Problems|
|Sort a stack|
|Delete Middle of Linked List|
|BFS traversal of graph|
|Largest subarray of 0's and 1's|
|Immediate Smaller Element|
|Delete nodes having greater value on right|
|Node at a given index in linked list|
|Two numbers with sum closest to zero|
|Print all nodes that don’t have sibling|
Given a Binary Search 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.
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.
The function should return the node which is the least common ancestor of the two nodes n1 and n2 .
1 <=T<= 100
1 <=Number of nodes<= 100
1 <=Data of a node<= 1000
5 4 6 3 7 8
The BST in above test case will look like
here the LCA of 7 and 8 is 7 .
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.