题目:
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.
解答:
两个反向的递归即可
/**
* 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 isSame(TreeNode* l,TreeNode* r)
{
if(l == NULL && r == NULL)
return true;
if(l == NULL || r == NULL)
return false;
if(l->val == r->val)
{
bool left = isSame(l->left,r->right);
bool right = isSame(l->right, r->left);
return left && right;
}
else
return false;
}
bool isSymmetric(TreeNode* root) {
if(!root)
return true;
if(root->left == NULL && root->right == NULL)
return true;
return isSame(root->left, root->right);
}
};