给定一棵二叉树的后序遍历和中序遍历,请你输出其层序遍历的序列。这里假设键值都是互不相等的正整数。
输入格式:
输入第一行给出一个正整数N(≤30),是二叉树中结点的个数。第二行给出其后序遍历序列。第三行给出其中序遍历序列。数字间以空格分隔。
输出格式:
在一行中输出该树的层序遍历的序列。数字间以1个空格分隔,行首尾不得有多余空格。
输入样例:
7
2 3 1 5 7 6 4
1 2 3 4 5 6 7
输出样例:
4 1 6 3 5 7 2
代码长度限制
16 KB
时间限制
400 ms
内存限制
64 MB
直接上代码了,自己琢磨
#include <iostream>
#include <vector>
#include <unordered_map>
#include <queue>
using namespace std;
struct TreeNode {
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder, int post_start, int post_end, int in_start, int in_end, unordered_map<int, int>& index_map) {
if (post_start > post_end || in_start > in_end) {
return NULL;
}
int root_val = postorder[post_end];
TreeNode* root = new TreeNode(root_val);
int root_index = index_map[root_val];
int left_size = root_index - in_start;
root->left = buildTree(inorder, postorder, post_start, post_start + left_size - 1, in_start, root_index - 1, index_map);
root->right = buildTree(inorder, postorder, post_start + left_size, post_end - 1, root_index + 1, in_end, index_map);
return root;
}
vector<int> levelOrder(TreeNode* root) {
vector<int> result;
if (!root) {
return result;
}
queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
TreeNode* node = q.front();
q.pop();
result.push_back(node->val);
if (node->left) {
q.push(node->left);
}
if (node->right) {
q.push(node->right);
}
}
return result;
}
int main() {
int N;
cin >> N;
vector<int> postorder(N);
vector<int> inorder(N);
unordered_map<int, int> index_map;
for (int i = 0; i < N; ++i) {
cin >> postorder[i];
}
for (int i = 0; i < N; ++i) {
cin >> inorder[i];
index_map[inorder[i]] = i;
}
TreeNode* root = buildTree(inorder, postorder, 0, N - 1, 0, N - 1, index_map);
vector<int> result = levelOrder(root);
for (int i = 0; i < result.size(); ++i) {
cout << result[i];
if (i < result.size() - 1) {
cout << " ";
}
}
cout << endl;
return 0;
}