# 101. Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

    1
/ \
2   2
/ \ / \
3  4 4  3


But the following [1,2,2,null,3,null,3] 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 isSymmetric(TreeNode* root) {
if (!root)
return true;
else
return testSymmetric(root->left,root->right);
}
bool testSymmetric(TreeNode* left,TreeNode* right)
{
if (!left&&!right)
return true;
else if (!left&&right)  return false;
else if (left&&!right)  return false;
else if (left&&right&&left->val!=right->val) return false;
else return testSymmetric(left->left,right->right)&&testSymmetric(left->right,right->left);
}
};

• 本文已收录于以下专栏：

举报原因： 您举报文章：101. Symmetric Tree 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)