Leetcode235Lowest Common Ancestor of a Binary Search Tree（二叉排序树的最近公共祖先）

. Lowest Common Ancestor of a Binary Search Tree

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

Example 1:
Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
Output: 6
 
Example 2:
Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
Output: 2

• 如果硬要讨论情况会很多，不如简化一下
• pq均大于，pq均小于，以及其他返回root（p大于q小于，p小于q大于，一个else就完事了）

 class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(p.val>root.val&&q.val>root.val){
            return lowestCommonAncestor(root.right,p,q);
        }//如果p q都大于root，说明肯定在root的右子树中
        else if(p.val<root.val&&q.val<root.val){
            return lowestCommonAncestor(root.left,p,q);
        }
        else{
            return root;
        }
    }
}