给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其自底向上的层次遍历为:
[
[15,7],
[9,20],
[3]
]
程序输出为:
15 7 9 20 3
#include <iostream>
#include <queue>
#include<vector>
#include <cstdlib>
#include <cstring>
#include<algorithm>
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(NULL), right(NULL) {}
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
/*
层次遍历的时候将一层的结点值加入到一个vector中,再将这个vector加入结果中
最后逆置结果即可
*/
class Solution{
public:
vector<vector<int> > levelOrderBottom(TreeNode* root) {
vector<vector<int> > result;
vector<int> vec;
if(root == NULL) {
return result;
}
queue<TreeNode*> Q;
Q.push(root);
while(!Q.empty()) {
int size = Q.size();
while(size-- > 0) {
//遍历该层的所有结点
TreeNode *cur = Q.front();
Q.pop();
if(cur != NULL) {
vec.push_back(cur->val);
}
if(cur->left != NULL) {
Q.push(cur->left);
}
if(cur->right != NULL) {
Q.push(cur->right);
}
}
if(!vec.empty()) {
result.push_back(vec);
}
vec.clear();
}
reverse(result.begin(),result.end());
return result;
}
};
TreeNode* inputTree()
{
int n,count=0;
char item[100];
cin>>n;
if (n==0)
return NULL;
cin>>item;
TreeNode* root = new TreeNode(atoi(item));
count++;
queue<TreeNode*> nodeQueue;
nodeQueue.push(root);
while (count<n)
{
TreeNode* node = nodeQueue.front();
nodeQueue.pop();
cin>>item;
count++;
if (strcmp(item,"null")!=0)
{
int leftNumber = atoi(item);
node->left = new TreeNode(leftNumber);
nodeQueue.push(node->left);
}
if (count==n)
break;
cin>>item;
count++;
if (strcmp(item,"null")!=0)
{
int rightNumber = atoi(item);
node->right = new TreeNode(rightNumber);
nodeQueue.push(node->right);
}
}
return root;
}
int main()
{
TreeNode* root;
root=inputTree();
vector<vector<int> > res=Solution().levelOrderBottom(root);
for(int i=0; i<res.size(); i++)
{
vector<int> v=res[i];
for(int j=0; j<v.size(); j++)
cout<<v[j]<<" ";
}
return 0;
}