题解 | #对称的二叉树#

/*
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) {
        return judge(pRoot,pRoot);
    }

    boolean judge(TreeNode p, TreeNode q){
        if(p==null&&q==null){
            return true;
        }else if(p==null || q==null){
            return false;
        }
        return p.val==q.val && judge(p.left,q.right) && judge(q.left,p.right);
    }
}