题目描述:
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
解题思路:
这题是二叉树的层序遍历,我们用广度优先搜索来实现。建立一个队列来保存被遍历的元素,由于这里要把每层的元素分开,所以我们使用了一个vector容器temp暂时保存每层的元素。
代码:
/**
* 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<int> temp; // 保存当前行元素
vector<vector<int>> bcak;
if (root == NULL) return back;
queue<TreeNode* > q;
TreeNode *p = root;
q.push(p);
while (!q.empty()) {
int num = q.size(); // 当前行元素个数
while (num--) { // 遍历完当前行再遍历下一行元素
p = q.front(); // 广度优先搜索
q.pop();
temp.push_back(p->val);
if (p->left != NULL) q.push(p->left);
if (p->right != NULL) q.push(p->right);
}
back.psuh_back(temp);
temp.clear();
}
return back;
}
};
代码运行结果: