[LeetCode]235. Lowest Common Ancestor of a Binary Search Tree

https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/

题目描述:Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”

    6
  /    \
 2      8
/ \    / \
0  4  7   9
   /\
  3  5

For example, the lowest common ancestor (LCA) of nodes 2 and 8 is 6. Another example is LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

解题思路:因为是二叉排序树，所以当两个节点都为空时返回null(特殊输入)；当两个节点的值都小于根节点时，在左子树中查找公共父节点；当两个节点的值都大于根节点时，在右子树中查找公共父节点；否则返回当前的父节点(找到)。

public class Lowest_Common_Ancestor_of_a_Binary_Search_Tree {

    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root==null||p==null||q==null){
            return null;
        }
        if(p.val<root.val&&q.val<root.val){
            return lowestCommonAncestor(root.left,p,q); 
        }else if(p.val>root.val&&q.val>root.val){
            return lowestCommonAncestor(root.right, p, q);
        }else{
            return root;
        }
    }

    class TreeNode{
        int val;
        public TreeNode(int x){
            val = x;
        }
        TreeNode left;
        TreeNode right;
    } 

}