We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Node*lca(Node*root,intv1,intv2){// Write your code here.while((v1>root->data&&v2>root->data)||(v1<root->data&&v2<root->data)){if(v1>root->data)root=root->right;elseroot=root->left;}returnroot;}
Cookie support is required to access HackerRank
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 →
C++ solution :