题解
递归三部曲掌握好,就能写出来下面的代码
// 269 t101 对称二叉树
public boolean isSymmetric(TreeNode root) {
if (root==null){
return true;
}
return isSymmetric(root.left,root.right);
}
public boolean isSymmetric(TreeNode left,TreeNode right) {
if (left==null&&right==null){
return true;
}
// 全空已经判断
if (left==null||right==null){
return false;
}
if (left.val==right.val){
return isSymmetric(left.left,right.right)&&isSymmetric(left.right,right.left);
}
return false;
}