My Java Solution - 96%


  • 0
    M
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
            if(root==null || root==p || root==q) return root;
            if(root.val<p.val && root.val<q.val) return lowestCommonAncestor(root.right,p,q);
            if(root.val>p.val && root.val>q.val) return lowestCommonAncestor(root.left,p,q);
            return root;
        }
    

Log in to reply
 

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