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*add1[25];Node*add2[25];inti=0,j=0;Node*lca(Node*root,intv1,intv2){// Write your code here.if(v1>root->data){root=lca(root->right,v1,v2);add1[i++]=root;}elseif(v2>root->data){root=lca(root->right,v1,v2);add2[j++]=root;}elseif(v1<root->data){root=lca(root->left,v1,v2);add1[i++]=root;}elseif(v2<root->data){root=lca(root->left,v1,v2);add2[j++]=root;}Node*a;for(inti=0;i<25;i++){for(intj=0;j<25;j++){if(add1[i]==add2[2]){a=add1[i];returna;}}}}
why this not working
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 →
why this not working