题意理解
按照层次从上到下打印二叉树
问题分析
用队列,通过队列长度限制读取的范围,保障二叉树打印效果。
其他
0919:勿自暴勿自弃圣与贤可训至
链接
/**
* 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>> res;
if (!root) {
return res;
}
queue<TreeNode*> que;
que.push(root);
while(!que.empty()) {
vector<int> curr_res;
int size = que.size(); //利用队列长度来遍历
for (int i = 0; i < size; i ++) {
TreeNode* p = que.front();
que.pop();
curr_res.push_back(p->val);
if (p->left) que.push(p->left);
if (p->right) que.push(p->right);
}
res.push_back(curr_res);
}
return res;
}
};