LeetCode Lowest Common Ancestor of a Binary Search Tree

原题链接在这里：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/

递归调用，如果p, q的值都小于root.val就在root.left中继续找，如果p, q的值都大于root.val就在root.right中继续找。

只有当root的val在p, q的val中间包括p, q的val时，返回root.

AC Java:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null){
            return root;
        }
        if(root.val < p.val && root.val < q.val){
            return lowestCommonAncestor(root.right,p,q);
        }else if(root.val > p.val && root.val > q.val){
            return lowestCommonAncestor(root.left,p,q);
        }else{
            return root;
        }
    }
}

进阶题目是Lowest Common Ancestor of a Binary Tree.