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 binary tree
* 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 judgeSymmetric(root, root);
}
bool judgeSymmetric(TreeNode *ltree, TreeNode *rtree) {
if (ltree == NULL && rtree == ltree)
return true;
else if ((ltree == NULL && rtree) || (ltree && rtree == NULL))
return false;
if (ltree->val == rtree->val)
return judgeSymmetric(ltree->left, rtree->right)
&& judgeSymmetric(ltree->right, rtree->left);
return false;
}
};