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
递归形式:
/**
* 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 {
private:
bool symmetric(TreeNode* left,TreeNode* right){
if(!left && !right)
return true;
if(left && right){
if(left->val != right->val)
return false;
return symmetric(left->left,right->right)&&symmetric(left->right,right->left);
}
return false;
}
public:
bool isSymmetric(TreeNode* root) {
if(!root)
return true;
return symmetric(root->left,root->right);
}
};
迭代形式:
/**
* 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;
stack<TreeNode*> left,right;
left.push(root->left);
right.push(root->right);
while(!left.empty()&&!right.empty()){
TreeNode* lf = left.top();
left.pop();
TreeNode* rg = right.top();
right.pop();
if(!lf&&!rg)
continue;
if((lf&&!rg )||(!lf&&rg) )
return false;
if(lf->val!=rg->val)
return false;
left.push(lf->left);
right.push(rg->right);
left.push(lf->right);
right.push(rg->left);
}
return true;
}
};