剑指Offer 27 二叉树的镜像

二叉树的镜像

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

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    # 返回镜像树的根节点
    def Mirror(self, root):
        if root == None:
            return None
        if root.left != None and root.right != None:
            temp = TreeNode(root.val)
            temp.left = root.left
            root.left = self.Mirror(root.right)
            root.right = self.Mirror(temp.left)
        elif root.left == None and root.right != None:
            root.left = self.Mirror(root.right)
            root.right = None
        elif root.right == None and root.left != None:
            root.right = self.Mirror(root.left)
            root.left = None
        return root
        # write code here