操作给定的二叉树,将其变换为源二叉树的镜像。

# -*- 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
            Solution.Mirror(self, root.left)
            Solution.Mirror(self, root.right)
            return root

 

posted @ 2017-09-04 11:52  kuqs(奇小东)  阅读(325)  评论(0)    收藏  举报