Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSymmetric(TreeNode* root) {
// return isSymmetric(root, root);
if(!root) return true;
queue<TreeNode*> Q1, Q2;
Q1.push(root->left);
Q2.push(root->right);
while(!Q1.empty() && !Q2.empty()){
TreeNode* left = Q1.front(); Q1.pop();
TreeNode* right = Q2.front(); Q2.pop();
if(!left && !right) continue;
if(!left || !right) 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;
}
bool isSymmetric(TreeNode* p, TreeNode* q){
if(!p || !q) return p == q;
return p->val == q->val && isSymmetric(p->left, q->right) && isSymmetric(p->right, q->left);
}
};