二叉树左右子树节点交换
class Solution:
def mirrorTree(self, root: TreeNode) -> TreeNode:
if not root: return
root.left,root.right = self.mirrorTree(root.right),self.mirrorTree(root.left)
return root
二叉树左右子树节点交换
class Solution:
def mirrorTree(self, root: TreeNode) -> TreeNode:
if not root: return
root.left,root.right = self.mirrorTree(root.right),self.mirrorTree(root.left)
return root