3 line Java code


  • 1
    W
    public class Solution {
        public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
            if(root==null||p.val==root.val||q.val==root.val||(p.val-root.val)*(q.val-root.val)<0) return root;
            if(p.val>root.val&&q.val>root.val)return lowestCommonAncestor(root.right,p,q);
            else 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.