题目描述:
代码:
class Solution(object):
def mirrorTree(self, root):
#递归调用,将二叉树左节点复制给右节点
if root == None:
return root
temp_point=root.right
root.right=self.mirrorTree(root.left)
root.left=self.mirrorTree(temp_point)
return root