4lines with O(1) space recursive solutions


  • 0
    N

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