CPP solution beats 97% Small, Simple and elegant 3 line Code.


  • 0
    S
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
            if(root==NULL)return root;
            
             if(p->val>root->val&&q->val>root->val) return lowestCommonAncestor(root->right,p,q);
             else if(p->val<root->val&&q->val<root->val) return lowestCommonAncestor(root->left,p,q);
             else return root;
            
            
        }
    
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.