class Solution {
public boolean isSymmetric(TreeNode root) {
return compare(root.left,root.right);
}
private boolean compare(TreeNode left,TreeNode right){
if(left == null && right != null){
return false;
}
if(left != null && right == null){
return false;
}
if(left == null && right == null){
return true;
}
if(left.val != right.val){
return false;
}
boolean compareOutSide = compare(left.left,right.right);
boolean compareInner = compare(left.right,right.left);
return compareInner && compareOutSide;
}
}
代码随想录算法训练营第十五天 101. 对称二叉树
最新推荐文章于 2024-07-19 22:53:00 发布