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 42Sample Output:
58 25 82 11 38 67 45 73 42中序遍历二叉树为数据递增,先序遍历为序号递增
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 101;
bool vis[maxn] = {0};
int num[maxn],n;
struct Node{
int data;
int lchild,rchild;
}node[maxn];
int number = 0;
void inOrder(int root){
if(root==-1) return;
inOrder(node[root].lchild);
node[root].data = num[number++];
inOrder(node[root].rchild);
}
int sq = 0;
void BFS(int v){
queue<int> q;
q.push(v);
vis[v] = 1;
printf("%d",node[v].data);
if(sq<n-1) printf(" ");
sq++;
while(!q.empty()){
int t = q.front();
q.pop();
int l = node[t].lchild,r = node[t].rchild;
if(l!=-1){
printf("%d",node[l].data);
if(sq<n-1) putchar(' ');
else putchar('\n');
q.push(l);
sq++;
}
if(r!=-1){
printf("%d",node[r].data);
if(sq<n-1) putchar(' ');
else putchar('\n');
q.push(r);
sq++;
}
}
}
int main(){
scanf("%d",&n);
for(int i = 0;i < n;i++){
scanf("%d %d",&node[i].lchild,&node[i].rchild);
}
for(int i = 0;i < n;i++)
scanf("%d",&num[i]);
sort(num,num+n); //排序,中序
inOrder(0);
BFS(0);
return 0;
}