题解 | #二叉树的镜像#
二叉树的镜像
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 # 如果结点为空,则返回None if pRoot is None: return None # 递归子树 left = self.Mirror(pRoot.left) right = self.Mirror(pRoot.right) # 交换 pRoot.left = right pRoot.right = left return pRoot#我的实习求职记录#