1、队列做FIFO先进先出
[1,2,3,4,5]
2、
/**
* 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> res;
if(!root) return res;
queue<TreeNode*> s;
s.push(root);
while(!s.empty())
{
int n = s.size();
for(int i = 0; i < n; i++)
{
TreeNode* tmp = s.front();
res.emplace_back(tmp->val);
if(tmp->left) s.push(tmp->left);
if(tmp->right) s.push(tmp->right);
s.pop();
}
}
return res;
}
};