题解 | #对称的二叉树#

知识点：二叉树，递归

新起的函数名是拼音式的，不符合规范，将就看啦

public class Solution {

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

boolean isSymmetrical(TreeNode pRoot) {
    if(pRoot==null)
        return true;
    return digui(pRoot.left,pRoot.right);
}

}