Lowest Common Ancestor of a Binary Search Tree


  • 0
    R

    class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
    if(root.val>java.lang.Math.max(p.val,q.val))
    return lowestCommonAncestor(root.left,p,q);
    if(root.val<java.lang.Math.min(p.val,q.val))
    return lowestCommonAncestor(root.right,p,q);
    else
    return root;
    }
    }


Log in to reply
 

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