int main() { Solution solution; Btree btree; vector<vector<int> > result; TreeNode *root; root=btree.contruct_tree(); result=solution.levelOrderBottom(root); for(vector<vector<int> >::iterator it=result.begin();it!=result.end();it++) { cout<<"["; for(vector<int>::iterator it2=it->begin();it2!=it->end();it2++) { cout<<*it2<<","; } cout<<"]"<<endl; } return 0; }
int main() { Solution solution; Btree btree; vector<int> result; TreeNode *root; root=btree.contruct_tree(); result=solution.postorderTraversal(root); for(vector<int>::iterator it2=result.begin();it2!=result.end();it2++) { cout<<*it2<<","; } return 0; }