描述
给出一棵二叉树,返回其节点值的层次遍历(逐层从左往右访问)
您在真实的面试中是否遇到过这个题? 是
样例
给一棵二叉树 {3,9,20,#,#,15,7}
:
3
/ \
9 20
/ \
15 7
返回他的分层遍历结果:
[
[3],
[9,20],
[15,7]
]
挑战
挑战1:只使用一个队列去实现它
挑战2:用DFS算法来做
题目链接
程序
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param root: A Tree
* @return: Level order a list of lists of integer
*/
vector<vector<int>> levelOrder(TreeNode * root) {
// write your code here
vector<vector<int>> result;
if(root == NULL)
return result;
std::queue<TreeNode *> Q;
Q.push(root);//创造仅含根节点的队列
while(!Q.empty()){//如果队列为空,则结束
vector<int> level;
int size = Q.size();
for(int i = 0; i < size; i++){
TreeNode *head = Q.front();
Q.pop();//取队列顶的元素,并弹出
level.push_back(head->val);
if(head->left != NULL)//将该节点所有的孩子节点压入队列
Q.push(head->left);
if(head->right != NULL)
Q.push(head->right);
}
result.push_back(level);
}
return result;
}
};