/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSymmetric(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!root) return true;
queue<TreeNode *> q;
q.push(root->left);
q.push(root->right);
while (!q.empty()) {
TreeNode *n1 = q.front();
q.pop();
TreeNode *n2 = q.front();
q.pop();
if (n1 && n2) {
if (n1->val != n2->val) return false;
q.push(n1->left);
q.push(n2->right);
q.push(n1->right);
q.push(n2->left);
} else if (!n1 && !n2) {
continue;
} else {
return false;
}
}
return true;
}
};
Small Case: 12ms
Large Case: 56ms
Time: O(n)
Space: O(n)