c语言动态演示二叉树的遍历

#include <graphics.h>
#include <stdio.h>
#include <stdlib.h>
#include <dos.h>
#include <time.h>
 
typedef struct TREE
{
   char data;
   struct TREE *lchild;
   struct TREE *rchild;
   int x;
   int y;
}Tree;
struct OUTPUT
{
   int x;
   int y;
   int num;
}s;

void HZ16(int x0,int y0,int w,int color,char *s)

{
 FILE *fp;
 register char buffer[32];
 register char str[2];
 unsigned long fpos;
 register int i,j,k;
fp=fopen("hzk16","r");

while(*s)
{
 if(*s<0)
 {
 str[0]=(*s)-0xa0;
 str[1]=*(s+1)-0xa0;
 fpos=((str[0]-1)*94+(str[1]-1))*32L;
 fseek(fp,fpos,SEEK_SET);
 fread(buffer,32,1,fp);
  for(i=0;i<16;i++)
   for(j=0;j<2;j++)
    for(k=0;k<8;k++)
     if (((buffer[i*2+j]>>(7-k))&0x1)!=NULL)
      putpixel(x0+8*j+k,y0+i,color);
  s+=2;
  x0+=w;
 }
 else
 {
     settextstyle(0,0,1);
     setcolor(color);
     str[0]=*s;str[1]=0;
     outtextxy(x0,y0+7,str);
     x0+=w-7;
     s++;
 }
}
fclose(fp);
}