# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param pRoot TreeNode类
# @return TreeNode类
#
class Solution:
def Mirror(self , pRoot: TreeNode) -> TreeNode:
# write code here
if not pRoot:
return None
root = TreeNode(pRoot.val)
root.left = self.Mirror(pRoot.right)
root.right = self.Mirror(pRoot.left)
return root
# 每次调用递归时都会建立本次函数内的根节点,再递归调用函数建立本次根节点的左右子树,直到遇到叶子节点为止