# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def mirrorTree(self, root):
"""
:type root: TreeNode
:rtype: TreeNode
"""
if root != None:
root.right,root.left = root.left,root.right
self.mirrorTree(root.right)
self.mirrorTree(root.left)
return root
二叉树的镜像
最新推荐文章于 2022-08-10 15:42:14 发布