题目描述
代码
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if root:
self.invertTree(root.left)
self.invertTree(root.right)
root.left,root.right=root.right,root.left
return root
题目描述
代码
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if root:
self.invertTree(root.left)
self.invertTree(root.right)
root.left,root.right=root.right,root.left
return root