LeetCode101
C++通过队列的方式实现。
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
bool isSymmetric(TreeNode* root) {
if (root == NULL)
return true;
queue<TreeNode*> left_q,right_q;
TreeNode *p, *q;
left_q.push(root->left);
right_q.push(root->right);
while(!left_q.empty() && !right_q.empty())
{
p = left_q.front();
q = right_q.front();
if (p && q)
{
if (p->val != q->val)
return false;
}
if ((p == NULL && q != NULL)||
(q == NULL && p != NULL))
{
return false;
}
if (p)
{
left_q.push(p->right);
left_q.push(p->left);
}
if (q)
{
right_q.push(q->left);
right_q.push(q->right);
}
left_q.pop();
right_q.pop();
}
return true;
}
};
int main()
{
TreeNode *a = new TreeNode(1);
TreeNode *b = new TreeNode(2);
TreeNode *c = new TreeNode(3);
TreeNode *d = new TreeNode(2);
TreeNode *e = new TreeNode(3);
a->left = b;
a->right = c;
b->left = e;
b->right = NULL;
c->left = d;
d->right = NULL;
Solution s;
cout<<s.isSymmetric(a)<<endl;
return 0;
}