pat_1099

源地址：http://www.patest.cn/contests/pat-a-practise/1099

这是个建立二叉树并填数的过程，平常写的比较少，不是很熟悉，练练手。

特别是那个填数的过程，其实就是用平常所谓的 中序遍历就可以将数字全部填入二叉树中。

还有一个层次遍历，那个我们用bfs常用的队列就可以搞定(其中这本身就是个广搜的过程)。

#include<stdio.h>#include<iostream>#include<string>#include<string.h>#include<algorithm>#include<iomanip>#include<vector>#include<time.h>#include<queue>#include<stack>#include<iterator>#include<math.h>#include<stdlib.h>#include<limits.h>#include<set>#include<map>//#define ONLINE_JUDGE#define eps 1e-8#define INF 0x7fffffff#define FOR(i,a) for((i)=0;i<(a);(i)++)#define MEM(a) (memset((a),0,sizeof(a)))#define sfs(a) scanf("%s",a)#define sf(a) scanf("%d",&a)#define sfI(a) scanf("%I64d",&a)#define pf(a) printf("%d\n",a)#define pfI(a) printf("%I64d\n",a)#define pfs(a) printf("%s\n",a)#define sfd(a,b) scanf("%d%d",&a,&b)#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)#define for1(i,a,b) for(int i=(a);i<b;i++)#define for2(i,a,b) for(int i=(a);i<=b;i++)#define for3(i,a,b)for(int i=(b);i>=a;i--)#define MEM1(a) memset(a,0,sizeof(a))#define MEM2(a) memset(a,-1,sizeof(a))const double PI=acos(-1.0);template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}template<class T> inline T Min(T a,T b){return a<b?a:b;}template<class T> inline T Max(T a,T b){return a>b?a:b;}using namespace std;#define ll long longint n,m;#define Mod 1000000007#define N 510#define M 1000100const int size = 46340+4;const int py = 10005;struct Node{int val;int id;Node *lchild,*rchild;};struct Rec{int id1,id2;}a[110];Node *head;int num[110];int id;void Build(Node *tmp,int s){//构造一颗二叉树if(a[s].id1 == -1 && a[s].id2 == -1)return;if(a[s].id1 != -1){tmp->lchild = new Node;tmp->lchild->id = a[s].id1;tmp->lchild->lchild = NULL;tmp->lchild->rchild = NULL;Build(tmp->lchild,a[s].id1);}if(a[s].id2 != -1){tmp->rchild = new Node;tmp->rchild->id = a[s].id2;tmp->rchild->lchild = NULL;tmp->rchild->rchild = NULL;Build(tmp->rchild,a[s].id2);}return;}void FILL(Node *tmp){//中序遍历填入数字if(id >= n)return;if(tmp){FILL(tmp->lchild);tmp->val = num[id++];FILL(tmp->rchild);}return;}void Print(Node *tmp){//层次遍历（用队列）queue<Node *> q;q.push(tmp);vector<int> v;while(!q.empty()){Node *tmp = q.front();q.pop();v.push_back(tmp->val);if(tmp->lchild)q.push(tmp->lchild);if(tmp->rchild)q.push(tmp->rchild);}int size = (int)v.size();for(int i=0;i<size;i++){if(i) printf(" ");printf("%d",v[i]);}printf("\n");}int main(){#ifndef ONLINE_JUDGE    freopen("in.txt","r",stdin);//  freopen("out.txt","w",stdout);#endif    while(scanf("%d",&n)!=EOF){    for(int i=0;i<n;i++)    sfd(a[i].id1,a[i].id2);    for(int i=0;i<n;i++)    sf(num[i]);    sort(num,num+n);    head = new Node;    head->id = 0;    head->lchild = NULL;    head->rchild = NULL;    id = 0;    Build(head,0);    FILL(head);    Print(head);    }return 0;}