二叉樹的鏡像和對稱的二叉樹

二叉樹的鏡像

題目描述：
操作給定的二叉樹，將其變換爲源二叉樹的鏡像。

代碼實現：

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

對稱的二叉樹

題目描述：
請實現一個函數，用來判斷一顆二叉樹是不是對稱的。注意，如果一個二叉樹同此二叉樹的鏡像是同樣的，定義其爲對稱的。
代碼實現：

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def fun(self,node1,node2):
        if not node1 and not node2:
            return True
        if node1 and node2 and node1.val == node2.val:
            return self.fun(node1.left, node2.right) and self.fun(node1.right, node2.left)
        return False
    def isSymmetrical(self, pRoot):
        # write code here
        if not pRoot:
            return True
        return self.fun(pRoot.left,pRoot.right)

【補充】可以用對稱的二叉樹思路判斷兩個二叉樹是否完全一致

def EqTree(self,TreeNode1,TreeNode2):
        if not TreeNode1 and not TreeNode2:
            return Ture
        if TreeNode1 and TreeNode2 and TreeNode1.val == TreeNode2.val:
            return Tree(TreeNode1.left,TreeNode2.left) and  Tree(TreeNode1.right,TreeNode2.right) 
        else:
            return False