class Solution {
public boolean isSymmetric(TreeNode root) {
return check(root, root);
}
public boolean check(TreeNode p, TreeNode q){
if(p == null && q == null){
return true;
}
else if(p == null || q == null){
return false;
}
else{
return p.val == q.val && check(p.left, q.right) && check(p.right, q.left);
}
}
}
力扣101.对称二叉树
最新推荐文章于 2023-02-17 13:18:15 发布