递归解法:
/**
* 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 fun(TreeNode* T1, TreeNode* T2)
{
if(!T1&&!T2)
return true;
if(T1==nullptr||T2==nullptr)
return false;
return (T1->val==T2->val&&
fun(T1->left,T2->right)&&
fun(T1->right,T2->left));
}
bool isSymmetric(TreeNode* root) {
if(!root)
return true;
return fun(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) {
queue<TreeNode*> data;
if(!root) return true;
data.push(root->left);
data.push(root->right);
while(data.size()!=0){
TreeNode* T1 = data.front();
data.pop();
TreeNode* T2 = data.front();
data.pop();
if(!T1&&!T2) continue;
if(!T1||!T2||T1->val!=T2->val) return false;
data.push(T1->left);
data.push(T2->right);
data.push(T1->right);
data.push(T2->left);
}
return true;
}
};