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.
方法1:同时遍历树的左右子树,每一次比较都是一个结果,返回所有结果的逻辑与值。比较值是否相同:左子树的左子树和右子树的右子树对应,左子树的右子树和右子树的左子树对应。结束条件:当一方为NULL,另一方不是是返回false,当两方同为空时返回true。
/**
* 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==NULL) return true;
return compare(root->left,root->right);
}
bool compare(TreeNode* left,TreeNode* right){
bool res=true;
if((left==NULL&&right!=NULL)||(right==NULL&&left!=NULL)) return false;
if(left==NULL&&right==NULL) return true;
if(left->val!=right->val) res=false;
return res&&compare(left->left,right->right)&&compare(left->right,right->left);
}
};