# -*- coding:utf-8 -*-
# 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:
root.left, root.right = root.right, root.left
self.Mirror(root.left)
self.Mirror(root.right)
二叉树的镜像
最新推荐文章于 2020-08-13 21:12:19 发布