宝山网站建设费用,网站制作行业,不禁网址的浏览器,百度营销推广登录该楼层疑似违规已被系统折叠 隐藏此楼查看此楼void TranslevelPrint(Bitree bt){struct node{Bitree vec[MAXLEN]; //存放树结点int layer[MAXLEN]; //结点所在的层int locate[MAXLEN]; //打印结点的位置int front,rear;}q;int i,j,k;int nLocate;j 1;k 0;q.front 0;q.rear …该楼层疑似违规已被系统折叠 隐藏此楼查看此楼void TranslevelPrint(Bitree bt){struct node{Bitree vec[MAXLEN]; //存放树结点int layer[MAXLEN]; //结点所在的层int locate[MAXLEN]; //打印结点的位置int front,rear;}q;int i,j,k;int nLocate;j 1;k 0;q.front 0;q.rear 0;//printf( );printf( );q.vec[q.rear] bt;q.layer[q.rear] 1;q.locate[q.rear] 20;q.rear q.rear 1;while(q.front q.rear){bt q.vec[q.front];i q.layer[q.front];nLocate q.locate[q.front];if(j i) //进层打印时换行{printf(\n);printf(\n);j j 1;k 0;while(k nLocate){printf( );k;}}while(k (nLocate-1)){printf( );k;}printf(%c,bt-data);q.front q.front 1;if(bt-lchild ! NULL) //左孩子不为空入队{q.vec[q.rear] bt-lchild;q.layer[q.rear] i 1;q.locate[q.rear] nLocate - pow(2, NLAYER-i-1);q.rear q.rear 1;}if(bt-rchild ! NULL) //右孩子不为空入队{q.vec[q.rear] bt-rchild;q.layer[q.rear] i 1;q.locate[q.rear] nLocate pow(2, NLAYER-i-1);q.rear q.rear 1;}}}
