void buildvector(TreeNode *root, int depth)
{
if(root == NULL)
return;
if(ret.size()== depth)
ret.push_back(vector<int>());
ret[depth].push_back(root->val);
buildvector(root->left,depth+1);
buildvector(root->right,depth+1);
}
int main() {
buildvector();
threadless();
threaded(1);
threaded(2);
//threaded(3);
threaded(4);
//threaded(5);
//threaded(6);
threaded(8);
threaded(16);
getch();
}
vector<vector<int>> levelOrder(TreeNode* root) {
buildvector(root,0);
return ret;
}
