牛客网 21天 1.1对称的二叉树

请实现一个函数，用来判断一颗二叉树是不是对称的。注意，如果一个二叉树同此二叉树的镜像是同样的，定义其为对称的。

Python2.7.3

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def isSymmetrical(self, pRoot):
        # 如果根为空 树对称
        if pRoot == None:
            return True
        # 比较两个二叉树
        return self.compareRoot(pRoot.left, pRoot.right)

    def compareRoot(self, left, right):
        #如果左子树的左孩子为空  判断右子树的右孩子是否为空 并返回True OR False 
        if left == None:
            return right == None
        #如果左左不为空  右右不为空  返回False
        if right == None:
            return False
        #如果都不为空  但值不同  返回False
        if left.val != right.val:
            return False
        #若都满足  递归调用左子树的左右  右子树的左右
        return self.compareRoot(left.left, right.right) and self.compareRoot(left.right, right.left)

c++

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    bool isSymmetrical(TreeNode* pRoot){
        if(pRoot == NULL){
            return true;
        }
        return compareRoot(pRoot->left, pRoot->right);
    }
    bool compareRoot(TreeNode *left, TreeNode *right){
        if(left == NULL)
            return (right == NULL);
        if(right == NULL)
            return false;
        if(left->val != right->val)
            return false;
        return compareRoot(left->left, right->right)&&compareRoot(left->right, right->left);
    }
};

java

/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    boolean isSymmetrical(TreeNode pRoot){
        if(pRoot==null) 
            return true;
        return isSymmetrical(pRoot.left,pRoot.right);
    }
    //方法的重构
    private boolean isSymmetrical(TreeNode left, TreeNode right){
        if(left == null)
            return (right == null);
        if(right == null)
            return false;
        if(left.val != right.val)
            return false;
        return isSymmetrical(left.left, right.right)&&isSymmetrical(left.right, right.left);
    }
}