前言
题目: 102. 二叉树的层序遍历
文档: 代码随想录——二叉树的层序遍历
编程语言: C++
解题状态: 如何分层打印出节点没考虑出来
思路
层序遍历也就是广度优先遍历,利用队列,每出去一个节点,就进来这个节点的子节点。难点是要考虑将每层的节点在数组中体现出来。
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*> q;
vector<vector<int>> result;
if (root != NULL) q.push(root);
while (!q.empty()) {
int size = q.size();
vector<int> vec;
for (int i = 0; i < size; i++) {
TreeNode* node = q.front();
q.pop();
vec.push_back(node -> val);
if (node -> left) q.push(node -> left);
if (node -> right) q.push(node -> right);
}
result.push_back(vec);
}
return result;
}
};