给出一棵二叉树,返回其节点值的层次遍历(逐层从左往右访问)
样例
给一棵二叉树 {3,9,20,#,#,15,7}
:
3
/ \
9 20
/ \
15 7
返回他的分层遍历结果:
[
[3],
[9,20],
[15,7]
]
/**
* 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>> path;
if(root == NULL)
{
return path;
}
else
{
queue<TreeNode*> q;
q.push(root);
while(!q.empty())
{
vector<int> temp;
int size=q.size();
for(int i=0;i<size;i++)
{
TreeNode *node = q.front();
q.pop();
temp.push_back(node->val);
if(node->left != NULL)
{
q.push(node->left);
}
if(node->right != NULL)
{
q.push(node->right);
}
}
path.push_back(temp);
temp.clear();
}
return path;
}
}
};