class Solution {
public boolean isSymmetric(TreeNode root) {
if(root==null){
return true;
}
return check(root.left,root.right);
}
public boolean check(TreeNode node1,TreeNode node2){
if(node1==null&&node2==null){
return true;
}
if(node1==null||node2==null){
return false;
}
return (node1.val==node2.val&&(check(node1.left,node2.right)&&check(node1.right,node2.left)));
}
}
leetcode:8.对称二叉树 简单
最新推荐文章于 2024-05-23 11:41:25 发布