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]
]
二叉树从底部向上的层序遍历,跟上一个层序遍历解法一样,只需要在最后做一个倒序即可。
【LeetCode】102. Binary Tree Level Order Traversal
/**
* 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>> res;
queue<TreeNode*> que;
if(root == NULL) return res;
que.push(root);
while(!que.empty()){
vector<int> oneLevel;
int size = que.size();
for(int i=0;i<size;i++){
TreeNode* tr=que.front();
que.pop();
oneLevel.push_back(tr->val);
if(tr->left) que.push(tr->left);
if(tr->right) que.push(tr->right);
}
res.push_back(oneLevel);
}
reverse(res.begin(),res.end());//从底向上层序遍历,在此处做一个倒序即可
return res;
}
};