class Solution:
def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
if root==None:
return root
if root.left==None and root.right==None:
return root
else:
temp=root.left
root.left=root.right
root.right=temp
if root.left:
self.invertTree(root.left)
if root.right:
self.invertTree(root.right)
return root
LeetCode-226.翻转二叉树(Python)
最新推荐文章于 2024-10-17 11:22:54 发布