Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree is symmetric:
1 / \ 2 2 / \ / \ 3 4 4 3
But the following is not:
1 / \ 2 2 \ \ 3 3
Note:
Bonus points if you could solve it both recursively and iteratively.
confused what"{1,#,2,3}"means? > read more on how binary tree is serialized on OJ.
OJ's Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
Here's an example:
1 / \ 2 3 / 4 \ 5
The above binary tree is serialized as"{1,2,3,#,#,4,#,#,5}".
题解:本题是easy题,刚开始没想到是对递归不熟练,可以把判断mirror交给左右子树,然后对当前节点进行判断时只要左右节点相等或同时为空即可,也可以用队列bfs解决,注意bfs解决时需要在push进队列的顺序上下功夫,也就是必须取出队列的两个点来比较,然后push它们的子节点时,必须先按第一个左孩子第二个右孩子对称顺序push才行
代码dfs版本:
class Solution {
public:
bool isSymmetric(TreeNode* root) {
if(root == nullptr) return true;
return isMirror(root->left,root->right);
}
bool isMirror(TreeNode* t1,TreeNode* t2)
{
if(t1 == nullptr && t2 == nullptr) return true;
if(t1 == nullptr || t2 == nullptr) return false;
return (t1->val == t2->val)&&isMirror(t1->left,t2->right)&&isMirror(t1->right,t2->left);
}
};
bfs版本:
/**
* 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) {
if(root == nullptr) return true;
queue<TreeNode*> q;
q.push(root);
q.push(root);
while(!q.empty()){
TreeNode* n1=q.front();
q.pop();
TreeNode* n2=q.front();
q.pop();
if(n1 == nullptr && n2 == nullptr) continue;
if(n1 == nullptr || n2 == nullptr) return false;
if(n1->val!=n2->val) return false;
q.push(n1->left);
q.push(n2->right);
q.push(n1->right);
q.push(n2->left);
}
return true;
}
};