8_2.txt

来自「数据结构及算法经典 讲述数据结构的经典算法c源程序」· 文本 代码 · 共 66 行

#include<stdio.h>
#include<stdlib.h>
typedef int elemtp;
typedef struct node{
  elemtp data;
  struct node *lchild,*rchild;
  }bst;
insertbst(bst **t,bst *p)
 {
  bst *h=*t,*pre=NULL;
   while(h){
   if(p->data<h->data){
          pre=h;
          h=h->lchild;
        }
   else{
        pre=h;
        h=h->rchild;
       }
   }
 if(pre->data<p->data)pre->rchild=p;
    else pre->lchild=p;
 }
  
createbttree(bst **t)
 {
  FILE *fp;elemtp a;bst *p;
 if((fp=fopen("data.txt","r+"))==NULL){
    printf("打开文件出错！");
    exit(0);
   }
/*fscanf(fp,"%d",&a);*/
 while(!feof(fp)){
   fscanf(fp,"%d",&a);
   if(!feof(fp))fscanf(fp,",");  
    p=(bst *)malloc(sizeof(bst));
    p->data=a;
    p->lchild=NULL;
    p->rchild=NULL;
    if(*t==NULL)*t=p;
      else insertbst(t,p);
  
   }
  fclose(fp);
  }
FILE *fp1;
inorder(bst *t)
 {
  if(t){
    inorder(t->lchild);
    fprintf(fp1,"%d  ",t->data);
    inorder(t->rchild);
    }
  } 
main()
{
 bst *t=NULL;
 createbttree(&t);
 if((fp1=fopen("data1.txt","w+"))==NULL){
    printf("打开文件出错！");
    exit(0);
   }
  else
   inorder(t);
  fclose(fp1);
}