Binary Tree Level Order Traversal II -- LeetCode, addbinaryleetcode
Question:
Given a binary tree, return the bottom-up level order traversal of its nodes 'values. (ie, from left to right, level by level from leaf to root ).
For example:
Given binary tree{3,9,20,#,#,15,7},
3 / \ 9 20 / \ 15 7
Return its bottom-up level order traversal:
[ [15,7] [9,20], [3],]
Train of Thought: like the above, you just need to note that the final output
void LevelOrder(BinTree* root){if(root == NULL)return ;deque<BinTree*> de;int num;int curnum=0;int i,j;BinTree* node;de.push_back(root);vector<int> vec;vector<vector<int> > result;num =1;while(!de.empty()){node = de.front();de.pop_front();num--;vec.push_back(node->value);if(node->left != NULL){de.push_back(node->left);curnum++;}if(node->right !=NULL){de.push_back(node->right);curnum++;}if(num ==0){num =curnum;curnum =0;result.push_back(vec);vec.clear();}}for(i=result.size()-1;i>=0;i--){for(j=0;j<result[i].size();j++)cout<<result[i][j]<<" ";cout<<endl;}}