Least Common Ancestor (LCA) problem.

You are given pointer to the root of the binary search tree and two values  and . You need to return the lowest common ancestor (LCA) of v1 and v2  in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3 . Node 3  is the lowest node which has nodes 4  and 6 as descendants. CODEContinue reading “Least Common Ancestor (LCA) problem.”

Create your website at WordPress.com
Get started