Share a C++ solution of mine


  • 0
    J
    class Solution {
    public:
        TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
            if((root->val - p->val) * (root->val - q->val) <= 0)
                return root;
            else if(root->val - p->val > 0)
                return lowestCommonAncestor(root->left, p, q);
            else
                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.