C++ Beats 98.04%, easy solution


  • 0
    E

    class Solution {
    public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
    if(root==NULL) return NULL;
    if((p->val<=root->val && root->val<=q->val) || (q->val<=root->val && root->val<=p->val)) return root;
    if (root->val<p->val) return lowestCommonAncestor(root->right,p,q);
    return lowestCommonAncestor(root->left,p,q);
    }
    };


Log in to reply
 

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