题解 | #二叉树的镜像#
二叉树的镜像
https://www.nowcoder.com/practice/a9d0ecbacef9410ca97463e4a5c83be7
# class TreeNode: # 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 # 如果不为空,则创建一颗新的树 head = TreeNode(pRoot.val) head.left = self.Mirror(pRoot.right) head.right = self.Mirror(pRoot.left) return head