class Solution:
def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
if p.val>root.val and q.val>root.val:
return self.lowestCommonAncestor(root.right,p,q)
elif p.val<root.val and q.val<root.val:
return self.lowestCommonAncestor(root.left,p,q)
else:
return root
235:二叉树的最近公共祖先
最新推荐文章于 2022-02-14 10:41:39 发布