题目:
源二叉树
8
/
6 10
/ \ /
5 7 9 11
镜像二叉树
8
/
10 6
/ \ /
11 9 7 5
class Solution:
def Mirror(self , pRoot ):
if pRoot:
tmp = pRoot.left
pRoot.left = pRoot.right
pRoot.right = tmp
self.Mirror(pRoot.left)
self.Mirror(pRoot.right)
return pRoot
讲解:递归解决,先遍历左子树,交换左右孩子,然后遍历右子树,交换左右孩子,类似于后序遍历