给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
例如:
给定二叉树: [3,9,20,null,null,15,7]
,
运用队来实现
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*> qu;
vector<vector<int>> vec;
qu.push(root);
int depth = 0;
while(!qu.empty())
{
vector<int> arr;
int count = qu.size();
while(count > 0)
{
root = qu.front(); qu.pop();
arr.push_back(root->val);
if(root->left != NULL)
{
qu.push(root->left);
}
if(root->right != NULL)
{
qu.push(root->right);
}
count--;
}
vec.push_back(arr);
}
return vec;
}
};