题解 | #对称的二叉树#

递归算法

    public class Solution {
        boolean result = false;
        boolean isSymmetrical(TreeNode pRoot) {
        if(pRoot == null) return true;
            return jude(pRoot.left , pRoot.right);
    }
    public boolean jude(TreeNode root1,TreeNode root2){
        if(root1 == null && root2 == null)
            return true;
        else if(root1 == null || root2 == null)
            return false;

        if(root1.val != root2.val)
            return false;
        else{
            return jude(root1.left,root2.right) && jude(root1.right,root2.left);
        }
    }
}