力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
public boolean isSymmetric(TreeNode root) {
//没有根节点直接为true
if (root == null) {
return true;
}
return check(root.left, root.right);
}
public boolean check(TreeNode left, TreeNode right) {
if (left == null && right == null) {
return true;
}
if (left == null || right == null) {
return false;
}
if (left.val != right.val) {
return false;
}
return check(left.left, right.right) && check(left.right, right.left);
}