剑指 Offer 32 - I. 从上到下打印二叉树
正确解法:
/**
* 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:
vector<int> levelOrder(TreeNode* root) {
vector<int> result;
if(root == nullptr)return result;
queue<TreeNode*> que;
que.push(root);
while(!que.empty()){
int size = que.size();
for(int i = 0; i < size; i++){
TreeNode* temp = que.front();
que.pop();
result.emplace_back(temp->val);
if(temp->left != nullptr)que.push(temp->left);
if(temp->right != nullptr)que.push(temp->right);
}
}
return result;
}
};
结果:
剑指 Offer 32 - II. 从上到下打印二叉树 II
正确解法:
/**
* 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:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> result;
if(root == nullptr)return result;
queue<TreeNode*> que;
que.push(root);
while(!que.empty()){
int size = que.size();
vector<int> arr;
for(int i = 0; i < size; i++){
TreeNode* temp = que.front();
que.pop();
arr.emplace_back(temp->val);
if(temp->left != nullptr)que.push(temp->left);
if(temp->right != nullptr)que.push(temp->right);
}
result.emplace_back(arr);
}
return result;
}
};
结果:
剑指 Offer 32 - III. 从上到下打印二叉树 III
正确解法:
/**
* 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:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> result;
if(root == nullptr)return result;
queue<TreeNode*> que;
que.push(root);
int flag = 1;
while(!que.empty()){
int size = que.size();
vector<int> arr;
for(int i = 0; i < size; i++){
TreeNode* temp = que.front();
que.pop();
if(flag)arr.emplace_back(temp->val);
else arr.insert(arr.begin(), temp->val);
if(temp->left != nullptr)que.push(temp->left);
if(temp->right != nullptr)que.push(temp->right);
}
flag = (flag?0:1);
result.emplace_back(arr);
}
return result;
}
};
结果: