二叉树辅助教学开发软件源程序.docVIP

/*二叉树演示源程序*/ #include graphics.h #include stdio.h #include stdlib.h #include dos.h #include time.h typedef enum {link,thread} pointertag;/*枚举值link和thread分别为0,1*/ typedef struct TREE { char data;/*树的结点数据*/ struct TREE *lchild; struct TREE *rchild; pointertag ltag,rtag; int x;/*树的x坐标*/ int y;/*树的y坐标*/ }Tree; struct OUTPUT { int x;/*三种遍历的x坐标*/ int y;/*三种遍历的y坐标*/ int num; }s; Tree *pre=NULL;/*全局变量，用于线索*/ int h=1;/*high*/ int nodeNUM=0;/*统计当前的结点数字,最多26个*/ char str[3];/*显示结点数据的字符串*/ void Init();/*图形初始化*/ void Close();/*图形关闭*/ Tree *CreatTree();/*文本模式下创建树的过程*/ Tree *InitTree(int h,int t,int w);/*创建树,h层次,t横坐标,w树之间的宽度,n树的建立方式*/ void DrawTree(Tree *t);/*用图形显示创建好的树*/ void Preorder(Tree *t);/*前序遍历*/ void Midorder(Tree *t);/*中序遍历*/ void Posorder(Tree *t);/*后序遍历*/ int TreeDeep(Tree *t);/*树的深度*/ void FindLeaf(Tree *t); Tree *CopyTree(Tree *t);/*复制树*/ void DrawNode(Tree *t,int color);/*遍历时显示每个结点的过程*/ void DrawNode1(Tree *t); void DrawNode2(Tree *t); void DrawNode3(Tree *t); void FindNode(Tree *t,char ch,int *n); void pre_thread(Tree *p);/*先序变量*/ void in_thread(Tree *p);/*中序线索化*/ void post_thread(Tree *p);/*后续线索化*/ Tree * DeleteNode(Tree *t,char ch);/*删除子树*/ void SeekNode(Tree *t,char ch,int a); void InsertNode(Tree *t); void Delete(Tree *t); void Destroy(Tree *t);/*释放空间*/ void ClrScr();/*清空树的区域*/ /*图形初始化*/ void Init() { int gd=DETECT,gm; registerbgidriver(EGAVGA_driver): initgraph(gd,gm,c:\\tc); cleardevice(); setcolor(YELLOW); outtextxy(250,10,This is the Tree!); setcolor(GREEN); outtextxy(20,370,Function Menu: ); outtextxy(20,400,1.preorder); outtextxy(20,430,2.midorder); outtextxy(20,460,3.porsorder); outtextxy(180,400,4.TreeDeep); outtextxy(180,430,5.FindLeaf); outtextxy(180,460,6.FindNode); outtextxy(340,400,7.pre_thread); outtextxy(340,430,8.in_thread); outtextxy(340,460,9.post_thread); outtextxy(500,400,a.InsertNode); outtextxy(500,430,b.DeleteChildTree); outtextxy(500,460,e.Esc); } void