3 Line recursive Java Solution


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