/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
return compare(root.left,root.right);
}
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 outside = compare(left.left,right.right);
boolean inside = compare(left.right,right.left);
return outside && inside;
}
}
代码随想录——101. 对称二叉树
最新推荐文章于 2024-07-08 05:06:14 发布