/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean check(TreeNode A, TreeNode B){
if(A==null && B==null) return true;
if((A==null&&B!=null) || (A!=null&&B==null)) return false;
boolean fl = false;
boolean fr = false;
if(A.val!=B.val) return false;
fl = check(A.left, B.right);
fr = check(A.right, B.left);
return (fl&&fr);
}
public boolean isSymmetric(TreeNode root) {
if(root==null) return true;
boolean flag = false;
boolean fl = false;
boolean fr = false;
if(root.left==null && root.right==null) return true;
if(root.left!=null && root.right!=null){
if(root.left.val==root.right.val){
if(this.check(root.left, root.right)) return true;
}else{
return false;
}
}
return false;
}
}
剑指 Offer 28. 对称的二叉树
最新推荐文章于 2024-09-28 10:34:40 发布