/**
* 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) {
vector<vector<int>>ans;
if(!root) return ans;
queue<TreeNode* >q;
q.push(root);
while(!q.empty())
{
vector<int>tmp;
int cnt = q.size();
for(int i = 0;i<cnt;i++)
{
TreeNode* p = q.front();
q.pop();
tmp.push_back(p->val);
if(p->left)
q.push(p->left);
if(p->right)
q.push(p->right);
}
ans.push_back(tmp);
}
return ans;
}
};