blob: fbd4bf394a9cea0b6afc62b047e34a37bccbd548 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
// 101. Symmetric Tree
#include "leetcode.h"
// given 'root' of binary tree, check whether it is a mirror of itself
class Solution {
public:
bool isSymmetric(TreeNode *root) {
TreeNode *left, *right;
if (!root)
return true;
queue<TreeNode *> q1, q2;
q1.push(root->left);
q2.push(root->right);
while (!q1.empty() && !q2.empty()) {
left = q1.front();
q1.pop();
right = q2.front();
q2.pop();
if (left == NULL && right == NULL)
continue;
if (left == NULL || right == NULL)
return false;
if (left->val != right->val)
return false;
q1.push(left->left);
q1.push(left->right);
q2.push(right->right);
q2.push(right->left);
}
return true;
}
};
|