给你一个二叉树的根节点 root , 检查它是否轴对称。
解答:递归
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool helper(TreeNode* l, TreeNode* r){
if(l == nullptr && r == nullptr) return true;
if(l != nullptr && r != nullptr){
if(l->val != r->val){
return false;
}else{
return (helper(l->left, r->right) && helper(l->right, r->left));
}
}else{
return false;
}
}
bool isSymmetric(TreeNode* root) {
return helper(root->left, root->right);
}
};
解答:迭代
class Solution {
public:
bool isSymmetric(TreeNode* root) {
queue<TreeNode*> q;
q.push(root->left);
q.push(root->right);
while(!q.empty()){
TreeNode* l = q.front();q.pop();
TreeNode* r = q.front();q.pop();
if(!l && !r) continue;
if((!l || !r) || (l->val != r->val)) return false;
q.push(l->left);
q.push(r->right);
q.push(l->right);
q.push(r->left);
}
return true;
}
};