1、题目描述
给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
2、示例
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其自底向上的层次遍历为:
[ [15,7],
[9,20],
[3] ]
3、题解
基本思想:队列,将每一层的节点按照先进先出顺序保存到queue队列
#include<iostream>
#include<vector>
#include<algorithm>
#include<iterator>
#include<deque>
using namespace std;
struct TreeNode {
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
#define inf 9999
void Init_TreeNode(TreeNode** T, vector<int>& vec, int& pos)
{
if (vec[pos] == inf || vec.size() == 0)
{
*T = NULL;
return;
}
else
{
(*T) = new TreeNode(0);
(*T)->val = vec[pos];
Init_TreeNode(&(*T)->left, vec, ++pos);
Init_TreeNode(&(*T)->right, vec, ++pos);
}
}
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
//基本思想:队列,将每一层的节点按照先进先出顺序保存到queue队列
vector<vector<int>> res;
if (root == NULL)
return res;
deque<TreeNode*> queue;
TreeNode* cur;
vector<int> vec;
queue.push_back(root);
while (!queue.empty())
{
//将保存在queue中的当前层节点从队尾弹出保存至vec,弹出的同时将下一层的节点从队首入队列
int len = queue.size();
for (int i = 0; i < len; i++)
{
cur = queue.back();
queue.pop_back();
vec.push_back(cur->val);
if (cur->left != NULL)
queue.push_front(cur->left);
if (cur->right != NULL)
queue.push_front(cur->right);
}
res.push_back(vec);
vec.clear();
}
//最后将res翻转就得到自底向上的层次遍历
reverse(res.begin(), res.end());
return res;
}
};
int main()
{
Solution solute;
TreeNode* root = NULL;
vector<int> vec = { 3,9,inf,inf,20,15,inf,inf,7,inf,inf };
int pos = 0;
Init_TreeNode(&root, vec, pos);
vector<vector<int>> res = solute.levelOrderBottom(root);
for (int i = 0; i < res.size(); i++)
{
copy(res[i].begin(), res[i].end(), ostream_iterator<int>(cout, " "));
cout << endl;
}
return 0;
}