www.ctrt.net > trEE trAvErsAls

trEE trAvErsAls

Source HDU 2007-Spring Programming Contest #include #include #include #include using namespace std; int m; typedef struct tree { tree *l,*r; int num; }tree; tree *creat(int *a,int *b,int n) { tree *t; int i; for(i=0;inum=b[i]; ...

如有不合题意之处,谅解,可以自己再改改。。 #include using namespace std; #include #include #define OK 1 #define ERROR 0 #define OVERFLOE -2 typedef char ElemType; const int maxlength=30;//结点个数不超过30个 typedef struct BiTre...

#include void build(int n,int a[],int b[],int c[]) { int i; int p; if(n

网站地图

All rights reserved Powered by www.ctrt.net

copyright ©right 2010-2021。
www.ctrt.net内容来自网络,如有侵犯请联系客服。zhit325@qq.com