题目链接:LC 102. 二叉树的层序遍历
2020.10.11第一次解答:
解题思路
基于bfs的原理,对算法稍作修改即可。
/**
* 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>> ans;
if (!root) return ans;
queue<TreeNode*> q;
TreeNode *cur, *end;
q.push(root);
while (!q.empty()) {
cur = q.front();
end = q.back();
vector<int> tmp;
while (cur != end) {
q.pop();
tmp.emplace_back(cur->val);
if (cur->left) q.push(cur->left);
if (cur->right) q.push(cur->right);
cur = q.front();
}
if (cur == end) {
q.pop();
tmp.emplace_back(cur->val);
if (cur->left) q.push(cur->left);
if (cur->right) q.push(cur->right);
}
ans.emplace_back(tmp);
}
return ans;
}
};