My 40ms C++ Solution

  • 6
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
            if(!root) return root;
        	if((root->val - p->val)*(root->val - q->val)<=0) return root;
        	if((root->val - p->val)>0 && (root->val - q->val)>0) return lowestCommonAncestor(root->left,p,q);
        	if((root->val - p->val)<0 && (root->val - q->val)<0) return lowestCommonAncestor(root->right,p,q);

Log in to reply

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