该代码没有错误，但无法运行。我在文件处理附近应用了各种打印语句。问题似乎就在那里。有人可以看看他们是否发现问题吗？
我的输入文件具有以下格式的数据：
Insert "tab>" "name" "tab""IDNo" "tab" "Department""newline"
Delete "tab""IDNO""newline"
Find"tab"IDNO"newline"
代码：
/*bst.h*/
typedef struct{
unsigned int id;
char name[20];
char dep[10];
}studRec;
struct bst;
typedef struct bst binTree;
typedef struct binTree *BST;
struct binTree{
studRec sRec;
BST left;
BST right;
};
/* bstMain.c*/
#include "bstOps.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(){
int s;
int key,i;
FILE *f;
char a[4][20];
f=fopen("input.txt","r");
if(f==NULL)
printf("error");
else
printf("no error");
char ch=getc(f);
studRec rec;
BST bt=createEmptyBST();
do{
for(i=0;ch!='\n';i++)
fscanf(f,"%s",a[i]);
if(a[0]=="Insert")
s=1;
else if(a[0]=="Delete")
{s=2;
key=atoi(a[1]);}
else if(a[0]=="Find"){
s=3;
key=atoi(a[1]);}
printf("To print the list, press 4\n To exit,press 5.\n");
scanf("%d",&s);
switch(s){
case 1:
strcpy(rec.name,a[1]);
rec.id=atoi(a[2]);
strcpy(rec.dep,a[3]);
bt=insertInBST(bt,rec);
break;
case 2:
bt=deleteFromBST(bt,key);
break;
case 3:
rec=findInBST(bt,key);
case 4:
inorderTraversal(bt);
break;
case 5:
printf("\nTerminating!!!\n");
break;
default:
printf("\nInvalid Option!! \n");
break;}
ch=getc(f);
}while(ch!=EOF||s==5);
fclose(f);
}
/*bstOps.c*/
#include "bstOps.h"
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
BST createEmptyBST(){
BST root;
root=(BST)malloc(sizeof(BST));
// root->sRec=(studRec *)malloc(sizeof(studRec));
root->sRec.id=0;
strcpy(root->sRec.name,"/");
strcpy(root->sRec.dep,"/");
root->left=NULL;
root->right=NULL;
//root=NULL;
return root;
}
BST insertInBST(BST bt,studRec rec){
BST bt1=createEmptyBST();
bt1=bt;
while(1){
/* if(bt==NULL){
bt->sRec=rec;
bt->left=NULL;
bt->right=NULL;
break;}
*/
if(bt->sRec.id==rec.id)
{
return bt;
break;
}
else if(rec.id<bt->sRec.id){
if(bt->left==NULL){
bt->left=createEmptyBST();
bt=bt->left;
bt->sRec=rec;
break;
}
else
bt=bt->left;
}
else{
if(bt->right==NULL){
bt->right=createEmptyBST();
bt=bt->right;
bt->sRec=rec;
break;
}
else
bt=bt->right;
}
}
printf("inserted\n");
return bt1;
}
void inorderTraversal(BST bt){
if(bt!=NULL){
inorderTraversal(bt->left);
if(bt->sRec.id!=0)
printf("\t Id:%d\n Name:%s\n Deparment:%s\n",bt->sRec.id,bt->sRec.name,bt->sRec.dep);
inorderTraversal(bt->right);
}
}
studRec findInBST(BST bt,int id){
BST temp=createEmptyBST();
if(bt==NULL||bt->sRec.id==0)
return temp->sRec;
if(id>bt->sRec.id)
return findInBST(bt->right,id);
else if(id<bt->sRec.id)
return findInBST(bt->left,id);
else
return bt->sRec;
}
BST deleteFromBST(BST bt,int id){
BST q;
if(bt==NULL||bt->sRec.id==0){
printf("\nElement not found\n");
}
else if(id>bt->sRec.id)
bt->right=deleteFromBST(bt->right,id);
else{
if(bt->right && bt->left){
q=FindMin(bt->right);
bt->sRec=q->sRec;
bt->right=deleteFromBST(bt->right,q->sRec.id);
}
else{
q=bt;
if(bt->left==NULL)
bt=bt->right;
else if(bt->right==NULL)
bt=bt->left;
free(q);
}
}
return bt;
}
BST FindMin(BST bt){
if(bt==NULL||bt->sRec.id==0){
return NULL;
}
if(bt->left)
return FindMin(bt->left);
else
return bt;
}
int getHeight(BST bt){
int h,lh,rh;
h=lh=rh-0;
if(bt->left!=NULL)
lh=(1+getHeight(bt->left));
else if(bt->right!=NULL)
rh=(1+getHeight(bt->right));
h=lh>rh?lh:rh;
return(h);
}