You are viewing a single comment's thread. Return to all comments →
static Node lca(Node root, int v1, int v2) { if(Math.max(v1, v2) < root.data) { return lca(root.left,v1,v2); } else if(Math.min(v1, v2) > root.data) { return lca(root.right,v1,v2); } return root; }
Seems like cookies are disabled on this browser, please enable them to open this website
Binary Search Tree : Lowest Common Ancestor
You are viewing a single comment's thread. Return to all comments →