# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def mirrorTree(self, root: TreeNode) -> TreeNode:
p = root
if p == None:
return root
p.left, p.right = p.right, p.left
self.mirrorTree(p.left)
self.mirrorTree(p.right)
return root
python太爽了,左右子树可以直接全部交换~~~~