leetcode之Lowest Common Ancestor of a Binary Search Tree

这题是求出2个的公共父节点。解决方法是由于这是一个BST，所以以root的值为界，很容易看是否在2边。如果在2边就返回root，不是则递归进行运算。代码如下：

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def lowestCommonAncestor(self, root, p, q):
        """
        :type root: TreeNode
        :type p: TreeNode
        :type q: TreeNode
        :rtype: TreeNode
        """
        if p.val <= root.val <= q.val or p.val >= root.val >= q.val:
            return root
        if p.val < root.val and q.val < root.val:
            return self.lowestCommonAncestor(root.left, p, q)
        if q.val > root.val and p.val > root.val:
            return self.lowestCommonAncestor(root.right, q, p)