二叉树的树形显示源代码.docx

二叉树的树形显示效果如下图模板程序如下(只需将程序放到一个头文件中然后再引入程序中调用函数void showTree( void(*visit)(char s,T t),T h,char filename)；即可,其中visit函数需要自己定义，完成将结点处显示的内容写入到s中,filename为输出文件的目录及文件名如:ok/a.txt，有时候树比较复杂时，文本不方便看，可以用浏览器打开，可以放大或缩小效果很不错)：#ifndef SHOWTREE_H#define SHOWTREE_H#include#include#includetypedef struct outtreeint width;int leftdis;char s20;struct outtree *left,*right,*next;OutNode,*OutTree;templatevoid midCreat(void(*visit)(char s,T t),OutTree &p1,T &p2,int &distance)if(p2)p1 = new OutNode;p1-next = NULL;midCreat(visit,p1-left,p2-left,distance);visit(p1-s,p2);p1-width = strlen(p1-s);p1-leftdis = distance ;distance += p1-width + 1 ;midCreat(visit,p1-right,p2-right,distance);elsep1 = NULL;void levelTravel(OutTree &h,char filename)int distance,k;OutTree p,q,f;/f指向当前层的最后一个元素FILE *fp;if(fp=fopen(filename,w)=NULL)printf(无法创建%sn,filename);exit(0);q = h ;f = h ;distance = 0 ;while(h)if(h-left)q-next = h-left;q = q-next ;if(h-right)q-next = h-right;q = q-next ;/左支if(h-left)k = h-left-leftdis + (h-left-width)/2 ;while(distanceleftdis ;while(distanceleftdis ;while(distances);distance+=h-width;/右支if(h-right)k = h-right-leftdis + (h-right-width+1)/2 ;while(distancenext ;delete p ;fclose(fp);templatevoid showTree( void(*visit)(char s,T t),T h,char filename)int distance = 0 ;OutTree head=NUL