Lowest Common Ancestor in a Binary Tree

05 Jun 2019

Node findLCA(Node node, int n1, int n2) 
{ 
	if (node == null) 
		return null; 

	if (node.data == n1 || node.data == n2) 
		return node; 

	Node left_lca = findLCA(node.left, n1, n2); 
	Node right_lca = findLCA(node.right, n1, n2); 

	if (left_lca!=null && right_lca!=null) 
		return node; 

	return (left_lca != null) ? left_lca : right_lca; 
}