树的公共祖先总结（236. 二叉树的最近公共祖先、235. 二叉搜索树的最近公共祖先）

236. 二叉树的最近公共祖先

236. 二叉树的最近公共祖先

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        def dfs(root):
            if not root or root==p or root==q:return root
            l=dfs(root.left)
            r=dfs(root.right)
            if l and r:return root
            if l or r:return l or r
            return 
        return dfs(root)

235. 二叉搜索树的最近公共祖先

递归1

235. 二叉搜索树的最近公共祖先

def dfs(root):
            if not root or root==p or root==q:return root
            l,r=None,None
            if p.val<root.val and q.val<root.val:l=dfs(root.left)
            elif p.val>root.val and q.val>root.val:r=dfs(root.right)
            else:
                l=dfs(root.left)
                r=dfs(root.right)
            if l and r:return root
            if l or r:return l or r
            return 
        return dfs(root)

递归2

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if root.val < p.val and root.val < q.val:
            return self.lowestCommonAncestor(root.right, p, q)
        if root.val > p.val and root.val > q.val:
            return self.lowestCommonAncestor(root.left, p, q)
        return root

迭代

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if p.val > q.val: p, q = q, p # 保证 p.val < q.val
        while root:
            if root.val < p.val: # p,q 都在 root 的右子树中
                root = root.right # 遍历至右子节点
            elif root.val > q.val: # p,q 都在 root 的左子树中
                root = root.left # 遍历至左子节点
            else: break
        return root