一、题目
二、代码
/**
* 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:
TreeNode* invertTree(TreeNode* root)
{
//我的理解是 只需要先右再左的层次遍历就可以了
int i,j;
TreeNode* return_tree=nullptr;
TreeNode* temp_node;
queue<TreeNode*> my_queue_for_save;
if(root==nullptr) return return_tree;
else
{
my_queue_for_save.push(root);
return_tree=root;
while(!my_queue_for_save.empty()) //队列中有元素 说明还没有构建完成
{
int queue_size=my_queue_for_save.size();
for(i=0;i<queue_size;i++)
{
TreeNode* node=my_queue_for_save.front();//取节点
my_queue_for_save.pop();
temp_node=node->left; //交换
node->left=node->right;
node->right=temp_node;
// 压入堆栈
if(node->left)
{
my_queue_for_save.push(node->left);
}
if(node->right)
{
my_queue_for_save.push(node->right);
}
}
}
}
return return_tree;
}
};