剑指 Offer 68 - I. 二叉搜索树的最近公共祖先

剑指 Offer 68 - I. 二叉搜索树的最近公共祖先

1.题目

2.我的解决方案

递归

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

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if not root or root == p or root == q:
            return root

        left = right= None  # 一定要先声明全局变量

        if root.val > p.val and root.val > q.val:   # 添加判断语句是为了省时间
            left = self.lowestCommonAncestor(root.left, p, q)
        elif root.val < p.val and root.val < q.val:
            right = self.lowestCommonAncestor(root.right, p, q)
        
        # else: 由于是二叉搜索树，在两边的话，root一定是最近公共祖先
        #     left = self.lowestCommonAncestor(root.left, p, q)
        #     right = self.lowestCommonAncestor(root.right, p, q)
        
        return root if not left and not right else left or right

• 时间复杂度:$O(n)$
• 空间复杂度:$O(1)$

循环：但是循环在平台上的运行效率不太好

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        while True:
            if root.val > p.val and root.val > q.val:   # 添加判断语句是为了省时间
                root = root.left
            elif root.val < p.val and root.val < q.val:
                root = root.right
            else:
                break
        return root

• 时间复杂度:$O(n)$
• 空间复杂度:$O(1)$