题目描述
给你一个二叉树的根节点 root , 检查它是否轴对称。
来源:leetcode https://leetcode.cn/problems/symmetric-tree/
解题
思路:使用递归函数 check(left, right),通过比较左、右子树来判断两个节点是否相等。如果两个节点都为空,说明已经检查完毕;如果其中有一个为空,或者它们的值不相等,那么就不是对称二叉树;否则继续递归检查它们的子节点。
/**
* 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) {
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 || right.val != left.val) {
return false;
}
return check(left.left, right.right) && check(left.right, right.left);
}
}