题目:
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.
代码如下:
bool isSymmetricTree(TreeNode *p, TreeNode *q) {
if(p==NULL&&q==NULL)return true;
if(p==NULL||q==NULL)return false;
if(p->val!=q->val)
{
return false;
}
else
{
return isSymmetricTree(p->left, q->right)&&isSymmetricTree(p->right, q->left);
}
}
bool isSymmetric(TreeNode *root) {
if(root==NULL)return true;
return isSymmetricTree(root->left,root->right);
}