You are viewing a single comment's thread. Return to all comments →
My C code 😁😎
struct node *lca( struct node *root, int v1, int v2 ) { while(root != NULL){ if(v1 < root->data && v2 < root->data){ root = root->left; }else if(v1 > root->data && v2 > root->data){ root = root->right; }else{ break; } } 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 →
My C code 😁😎