102. Binary Tree Level Order Traversal
问题:
层序遍历BTree, 逐层.
思路:
和普通的层序相比, 需要对每层截断一下.
逐层入队, 使用queue的size, 逐层出队,再将下一层入队.
code:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
#include <queue>
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> result;
if (!root) return result;
queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
vector<int> res;
int len = q.size();
for (int i = 0; i < len; i++) {
TreeNode* r = q.front();
q.pop();
res.push_back(r->val);
if (r->left) q.push(r->left);
if (r->right) q.push(r->right);
}
result.push_back(res);
}
return result;
}
};