PAT(甲级)1099

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 <iostream>
  #include <algorithm>
  #include <deque>
  
  #define SIZE 101
  
  using namespace std;
  
  int bt[SIZE][2];
  int date[SIZE];
  int value[SIZE];
  
  deque<int> q;
  
  void Midorder(int bt[][2],int pos,int value[],int date[]){
  	static int k=0;
  	if(pos == -1 )
  	    return;
  	else{
  		Midorder(bt,bt[pos][0],value,date);
  		value[pos] = date[k++];
  		Midorder(bt,bt[pos][1],value,date);
  	}
  }
  
  void BFS(int bt[][2],int N,int value[],int date[]){
  	deque<int> q;
  	q.push_back(0);
  //	q.push_back(-1);
  	int current,count=0;
  	while(!q.empty()){
  		current = q.front();
  		q.pop_front();
  		date[count++] = value[current];
  		int left = bt[current][0];
  		int right = bt[current][1];
  		if(left != -1)
  		    q.push_back(left);
  		if(right != -1)
  		    q.push_back(right);
  	}
  }
  
  int main()
  {
  	int N;
  //	freopen("test.txt","r",stdin);
  	scanf("%d",&N);
  	for(int i=0;i<N;i++){
  		scanf("%d %d",&bt[i][0],&bt[i][1]);
  	}
  	for(int i=0;i<N;i++){
  		scanf("%d",&date[i]);
  	}
  //	for(int i=0;i<N-1;i++)
  //	    printf("%d %d\n",bt[i][0],bt[i][1]);
  	
  	sort(date,date+N);
  	Midorder(bt,0,value,date);
  	BFS(bt,N,value,date);
  	for(int i=0;i<N-1;i++)
  	    printf("%d ",date[i]);
  	printf("%d",date[N-1]);
  	
  //	fclose(stdin);
  	return 0;
  }