一、题目
二、代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution
{
public:
bool isSymmetric(TreeNode* root)
{
queue<TreeNode*> my_queue;
int return_bool=0;
vector<int> temp_vector;
int i,j;
if(root==nullptr) return 0;
else
{
my_queue.push(root);
while(my_queue.size()!=0)
{
int temp_size=my_queue.size();
temp_vector.clear();
std::cout<<" 每一层 "<<std::endl;
for(i=0;i<temp_size;i++)
{
TreeNode* temp_node=my_queue.front();
my_queue.pop();
if(temp_node==nullptr) temp_vector.push_back(101);
else
{
my_queue.push(temp_node->left);
my_queue.push(temp_node->right);
temp_vector.push_back(temp_node->val);
}
//std::cout<<" temp_node->val "<<temp_node->val;
}
for(i=0;i<=temp_vector.size()/2;i++)
{
if(temp_vector[i]!=temp_vector[temp_vector.size()-1-i]) return 0;
}
std::cout<<std::endl;
}
return 1;
}
}
};