【剑指offer】二叉树镜像【python】
题目描述
操作给定的二叉树，将其变换为源二叉树的镜像。
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
# 返回镜像树的根节点
def Mirror(self, root):
# write code here
if root == None:
return None
if root.left == None and root.right == None:
return root
root.left, root.right = self.Mirror(root.right), self.Mirror(root.left)
return root