题目描述:
给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树 [3,9,20,null,null,15,7],3
/ \
9 20
/ \
15 7
返回其自底向上的层次遍历为:[
[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>>res;
if(root==NULL)
return res;
queue<TreeNode* >q;
q.push(root);
while(q.empty()!=true)
{
int size = q.size();
vector<int>level;
for(int i=0;i<size;i++)
{
TreeNode* node = q.front();
q.pop();
level.push_back(node->val);
if(node->left)
q.push(node->left);
if(node->right)
q.push(node->right);
}
res.push_back(level);
}
reverse(res.begin(), res.end());
return res;
}
};
或者可以这样写,每次从头部插入每一层的节点
/**
* 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;
if(root==NULL)
return res;
queue<TreeNode* >q;
q.push(root);
while(q.empty()!=true)
{
int size = q.size();
vector<int>level;
for(int i=0;i<size;i++)
{
TreeNode* node = q.front();
q.pop();
level.push_back(node->val);
if(node->left)
q.push(node->left);
if(node->right)
q.push(node->right);
}
res.insert(res.begin(), level); //这里有所不同
}
return res;
}
};