PAT 甲级 1020（Tree Traversals ）

最新推荐文章于 2021-02-21 14:44:05 发布

灏辕

最新推荐文章于 2021-02-21 14:44:05 发布

阅读量163

点赞数

分类专栏： PAT 文章标签：二叉树队列算法 bfs c++

本文链接：https://blog.csdn.net/qq_42865772/article/details/108535753

版权

PAT 专栏收录该内容

82 篇文章 0 订阅

订阅专栏

PAT 甲级 1020

题目要求
翻译
代码
思路

题目要求

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tree.

Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤30), the total number of nodes in the binary tree. The second line gives the postorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.

Output Specification:
For each test case, print in one line the level order traversal sequence of the corresponding binary tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the end of the line.

Sample Input:
7
2 3 1 5 7 6 4
1 2 3 4 5 6 7
Sample Output:
4 1 6 3 5 7 2

翻译

分别输入后序和中序的树，要求输出层次遍历的结果

代码

#include<iostream>
#include<queue>
using namespace std;

struct node
{
    int value;
    node* left, *right;
};

//inorder 中序
//postorder 后序
//preorder 前序
int post[40],in[40];
node* makenode(int h1,int t1,int h2,int t2)
{
    if(h1>t1) return NULL;
    node *p=new node;
    p->value = post[t1];
    int index;
    for(index = h2;in[index]!=post[t1];index++);
    p->left = makenode(h1,index-1-h2+h1,h2,index-1);
    p->right = makenode(index-h2+h1,t1-1,index+1,t2);
    return p;
}
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>post[i];
    for(int i=0;i<n;i++) cin>>in[i];
    node*root= makenode(0,n-1,0,n-1);
    //层序遍历
    queue<node*> q;
    q.push(root);
    int i;
    while (!q.empty())
    {
        if(i!=0) cout<<" ";
        i++;
        node *front =q.front();
        cout<<front->value;
        q.pop();
        if(front->left!=nullptr) q.push(front->left);
        if(front->right!=nullptr) q.push(front->right);
    }
    system("pause");
}