题目:
给你一个二叉树的根节点 root
, 检查它是否轴对称。
示例 1:
输入:root = [1,2,2,3,4,4,3] 输出:true
示例 2:
输入:root = [1,2,2,null,3,null,3] 输出:false
提示:
- 树中节点数目在范围
[1, 1000]
内 -100 <= Node.val <= 100
进阶:你可以运用递归和迭代两种方法解决这个问题吗?
代码:
递归:
class Solution {
public:
bool compare(TreeNode* left, TreeNode* right){
//递归结束条件
if (left == NULL && right != NULL) return false;
else if (left != NULL && right == NULL) return false;
else if (left == NULL && right == NULL) return true;
else if (left->val != right->val) return false;
// 单次递归:当left和right都不是NULL,且val相同,往下递归,否则结束递归
bool leftComp = compare(left->left, right->right); // 左子树的左vs右子树的右
bool rightComp = compare(left->right, right->left);//左子树的右vs右子树的左
bool res = leftComp && rightComp; //左右子树都return true,都相等,最终才为true
return res;
}
bool isSymmetric(TreeNode* root) {
if (root == NULL) return true;
return compare(root->left, root->right);
}
};
非递归:
class Solution {
public:
bool isSymmetric(TreeNode* root) {
if (root == NULL) return true;
queue<TreeNode*> que;
que.push(root->left);
que.push(root->right);
while (!que.empty()){
TreeNode* leftNode = que.front();
que.pop();
TreeNode* rightNode = que.front();
que.pop();
if (leftNode == NULL && rightNode == NULL) continue;
if (!leftNode || !rightNode || (leftNode->val != rightNode->val)) return false;
que.push(leftNode->left);
que.push(rightNode->right);
que.push(leftNode->right);
que.push(rightNode->left);
}
return true;
}
};