[못품/릿코드/javascirpt] 235. Lowest Common Ancestor of a Binary Search Tree

var lowestCommonAncestor = function(root, p, q) {
    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;
};

 

도대체가 릿코드 문제는 푼게 없다..^^;;;