数据结构实验四二叉树.docxVIP

实验四二叉树的存储及应用 void ShowBinTree(BinTree t)BinTree stack[Maxnode],p; int level [Maxnode] [2] ,top,n,i,width=4,k=o; if(t!=NULL){printf(n\n\t\t binary tree show\n\t\tn); top=i;stack[top]=t; level [top] [o] =width;while(topo) {p=stack[top];n=level[top][o]; fbr(i=i;i=n;i++) printf「)；printf(n%c H,p-data); k=k+i; if(k==i)printf(Hroot:n);else if(level[top] [i]==i) printf(lchild:); else printf(nrchild:);fbr(i=n+i;i3o;i++) printf(n#);printf(\n\t\t); top-;if(p-rchild!=NULL) {top++; stack[top] =p-rchild; level [top] [o] =n+width; level[top][i] =2; ) if(p-lchild!=NULL) {top++;stack[top]=p-lchild; level [top]