PATA1099

最新推荐文章于 2021-07-30 22:17:35 发布

boboanan==

最新推荐文章于 2021-07-30 22:17:35 发布

阅读量200

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/u014226072/article/details/58592238

版权

PAT 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

1099. Build A Binary Search Tree (30)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

The left subtree of a node contains only nodes with keys less than the node's key.
The right subtree of a node contains only nodes with keys greater than or equal to the node's key.
Both the left and right subtrees must also be binary search trees.
Given the structure of a binary tree and a sequence of distinct integer keys, there is only one way to fill these keys into the tree so that the resulting tree satisfies the definition of a BST. You are supposed to output the level order traversal sequence of that tree. The sample is illustrated by Figure 1 and 2.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (<=100) which is the total number of nodes in the tree. The next N lines each contains the left and the right children of a node in the format "left_index right_index", provided that the nodes are numbered from 0 to N-1, and 0 is always the root. If one child is missing, then -1 will represent the NULL child pointer. Finally N distinct integer keys are given in the last line.

Output Specification:

For each test case, print in one line the level order traversal sequence of that tree. All the numbers must be separated by a space, with no extra space at the end of the line.
Sample Input:
```
9
1 6
2 3
-1 -1
-1 4
5 -1
-1 -1
7 -1
-1 8
-1 -1
73 45 11 58 82 25 67 38 42
```
Sample Output:
```
58 25 82 11 38 67 45 73 42
```

#include<cstdio>

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

const int maxn = 110;

struct Node{
    int data;
    int left,right;
    bool flag;
}n[maxn];

int now = 0;
void inOrder(int start,int origin[]){
    if(n[start].flag!=false){
        if(n[start].left!=-1)inOrder(n[start].left,origin);
        n[start].data = origin[now++];
        if(n[start].right!=-1)inOrder(n[start].right,origin);
    }
    return;
}

void levelOrder(int start){
    queue<int> q;
    q.push(start);
    printf("%d",n[start].data);
    while(!q.empty()){
        int front = q.front();
        if(front!=start){
          printf(" %d",n[front].data);
        }
        q.pop();
        if(n[front].left!=-1)q.push(n[front].left);
        if(n[front].right!=-1)q.push(n[front].right);
    }

}

int main(){
    int sum,digit[maxn];
    scanf("%d",&sum);
    for(int i =0;i<maxn;i++){
        n[i].left = n[i].right = -1;
        n[i].flag = false;
    }
    for(int i=0;i<sum;i++){
        int l,r;
        scanf("%d%d",&l,&r);
        n[i].left = l;
        n[i].right = r;
        n[i].flag = true;
    }
    for(int i=0;i<sum;i++){
        scanf("%d",&digit[i]);
    }
    sort(digit,digit+sum);
    inOrder(0, digit);
    levelOrder(0);
}