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,null,null,15,7]
,
3
/ \
9 20
/ \
15 7
return its bottom-up level order traversal as:
[
[15,7],
[9,20],
[3]
]
代码:
非递归方法:
/**
* 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>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> out;
if(NULL == root) return out;
queue<TreeNode*> queue;
queue.push(root);
while(!queue.empty()){
vector<int> vec;
int size = queue.size();
for(int i = 0; i < size; i++){
TreeNode *node = queue.front();//队首
queue.pop();//删除队首
vec.push_back(node->val);
if(node->left != NULL) queue.push(node->left);
if(node->right != NULL) queue.push(node->right);
}
out.insert(out.begin(),vec);
}
return out;
}
};