题意描述
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,#,#,15,7},
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
给出一个二叉树,输出该二叉树的的层序遍历结果,并且这个层序遍历的结果是按层划分的
思路分析:
利用队列来实现二叉树的层序遍历:维护两个队列current和next,current中是当前层中的节点,next是下一层的节点,同时开两个容器level和result,level中是当前层节点的值,result是遍历结果,若current非空,则弹出队首节点,将该点的值放入level末尾,并将该节点的左儿子和右儿子加入next队列,当current为空时,意味着该层遍历结束,将level加入result,清空level,并将current与next互换,当next也为空时,意味着遍历结束,返回result即可
C++实现
class Solution {
public:
vector<vector<int> > levelOrder(TreeNode *root)
{
std::vector<vector<int> > result;
if(root==nullptr) return result;
std::vector<int> level;
queue<TreeNode *> current,next;
current.push(root);
while(!current.empty())
{
while(!current.empty())
{
TreeNode *node=current.front();
current.pop();
level.push_back(node->val);
if(node->left!=nullptr) next.push(node->left);
if(node->right!=nullptr) next.push(node->right);
}
result.push_back(level);
level.clear();
swap(current,next);
}
return result;
}