1020 Tree Traversals

最新推荐文章于 2023-04-14 16:43:07 发布

xumingyukou

最新推荐文章于 2023-04-14 16:43:07 发布

阅读量90

点赞数

分类专栏： PAT甲级文章标签： c++

本文链接：https://blog.csdn.net/weixin_44230791/article/details/123210526

版权

PAT甲级专栏收录该内容

74 篇文章 0 订阅

订阅专栏

该篇博客介绍了如何通过给定的后序遍历和中序遍历序列来构建并输出对应的二叉树的层次遍历序列。作者首先提供了创建二叉树的递归函数，然后利用广度优先搜索（BFS）进行层次遍历。代码实现采用C++，并通过样例输入和输出展示了算法的正确性。

摘要由CSDN通过智能技术生成

1020 Tree Traversals

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<cstdio>
#include<queue>
using namespace std;


struct node
{
  int val;
  node* left;
  node* right;
};

int n;
int post[35];
int in[35];

node* create(int postL, int postR, int inL, int inR)
{
  if (postL > postR)
  {
    return NULL;
  }
  node* root=new node;
  root->val = post[postR];
  int k = -1;  //根节点在中序序列中的位置
  for (int i = inL; i <= inR; i++)
  {
    if (in[i] == root->val)
    {
      k = i;
    }
  }
  node* lroot = create(postL, postL + k - inL - 1, inL, k - 1);
  node* rroot = create(postL + k - inL, postR - 1, k + 1, inR);
  root->left = lroot;
  root->right = rroot;
  return root;
}

void BFS(node* root)
{
  int i = 0;
  queue<node> Q;
  Q.push(*root);
  while (!Q.empty())
  {
    node p = Q.front();
    Q.pop();
    printf("%d", p.val);
    i++;
    if (i < n)
    {
      printf(" ");
    }
    else
    {
      printf("\n");
    }
    if (p.left)
    {
      Q.push(*(p.left));
    }      
    if (p.right)
    {
      Q.push(*(p.right));
    }
  }
}

int main()
{
  scanf_s("%d", &n);
  for (int i = 0; i < n; i++)
  {
    scanf_s("%d", &post[i]);
  }
  for (int i = 0; i < n; i++)
  {
    scanf_s("%d", &in[i]);
  }
  node* root=create(0, n - 1, 0, n - 1);
  BFS(root);
  
}