/**
* Definition for binary tree
* 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 == NULL){
return ans;
}
vector<int> tmp_value;
queue <TreeNode *> nodes;
queue <int> depths;
depths.push(1);
int min_depth = 1;
TreeNode *tmp_node;
int tmp_depth;
nodes.push(root);
while(!nodes.empty()){
tmp_node = nodes.front();
nodes.pop();
tmp_depth = depths.front();
depths.pop();
if(tmp_depth > min_depth){
min_depth = tmp_depth;
ans.push_back(tmp_value);
tmp_value.clear();
}
tmp_value.push_back(tmp_node->val);
if(tmp_node -> left){
nodes.push(tmp_node -> left);
depths.push(tmp_depth + 1);
}
if(tmp_node -> right){
nodes.push(tmp_node -> right);
depths.push(tmp_depth + 1);
}
}
if(tmp_value.size()>0){
ans.push_back(tmp_value);
}
return ans;
}
};
* Definition for binary tree
* 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 == NULL){
return ans;
}
vector<int> tmp_value;
queue <TreeNode *> nodes;
queue <int> depths;
depths.push(1);
int min_depth = 1;
TreeNode *tmp_node;
int tmp_depth;
nodes.push(root);
while(!nodes.empty()){
tmp_node = nodes.front();
nodes.pop();
tmp_depth = depths.front();
depths.pop();
if(tmp_depth > min_depth){
min_depth = tmp_depth;
ans.push_back(tmp_value);
tmp_value.clear();
}
tmp_value.push_back(tmp_node->val);
if(tmp_node -> left){
nodes.push(tmp_node -> left);
depths.push(tmp_depth + 1);
}
if(tmp_node -> right){
nodes.push(tmp_node -> right);
depths.push(tmp_depth + 1);
}
}
if(tmp_value.size()>0){
ans.push_back(tmp_value);
}
return ans;
}
};