Question

请各位大侠帮帮忙，数据结构二叉排序树的操作实现

这段程序出了很多错误，自己都看不懂，请高手帮忙修改一下，谢谢~
#include "stdio.h"
#include "conio.h"
#include "malloc.h"

typedef int ElementType;
typedef struct TreeNode * Position;
typedef struct TreeNode * SearchTree;
SearchTree Insert(ElementType X,SearchTree T);
SearchTree Delete(ElementType X,SearchTree T);
Position FindMin(Searchtree T);
struct TreeNode
{ElementType Element;
SearchTree Left;
SearchTree Right;};
struct TreeNode * creat (void)
{SearchTree root;
ElementType X;
printf("input records:\n");
scanf("%d",&X);
while(X!=NULL)
{root=Insert(X,root);
print("input the inserted number:");
Scanf("%d",&X);}
return root;
}

SearchTree Insert(ElementType X,SearchTree T)
{
if(T==NULL)
{ T=malloc(sizeof(struct TreeNode));
if(T==NULL)
FatalError("Out of space!!!");
else
{
T->Element =X;
T->Left =T->Right = NULL;
}
}
else
if(X<T->Element)
T->Left = Insert(X,T->Left);
else
if(X>T->Element)
T->Right=Insert(X,T->Right);
return T;
}

SearchTree Delete(ElementType X,SearchTree T)
{position TmpCell;
if(T==NULL)
Error("Element not found");
else
if(X<T->Element)
T->Left = Delete(X,T->Left);
else
if(X>T->Element)
T->Right = Delete(X,T->Left);
else
if(T->Left && T->Right)
{TmpCell = FindMin(T->Right);
T->Element = TmpCell->Element;
T->Right = Delete(T->Element,T->Right);
}
else
{TmpCell = T;
if(T->Left == NULL)
T = T->Right;
else if(T->Right == NULL)
T=T->Left;
free(TmpCell);}
return T;
}

Position FindMin(Searchtree T)
{
if(T !=NULL)
return NULL;
else
if(T->Left==NULL)
return T;
else
return FindMin(T->Left);
}

void preOrder(Searchtree T)
{
if(T != NULL)
{
printf("%d ", T->Element);
preOrder(T->Left);
preOrder(T->Right);
}
return;
}

void main()
{SearchTree root; Left,Right;
ElementType X;
root=creat();
preOrder(root);
printf("input the inserted number:");
scanf“%d”,&X);
while(X!==Null)
{
root=Insert(X,root);
preOrder(root);
printf("input the inserted number:");
scanf“%d”,&X);
}
printf（"input the deleted number:");
scanf(“%d”,&X);
while(X!==Null)
{
root=Delete(X,root);
preOrder(root);
printf（"input the deleted number:");
scanf(“%d”,&X);
}
}

Answer 1

有很多大小写错误，全角半角的错误
现在以及修改好了，能编译通过了。

#include "stdio.h"
#include "conio.h"
#include "malloc.h"

struct TreeNode;//添加的语句
typedef struct TreeNode *SearchTree;//添加的语句
typedef struct TreeNode *Position;//添加的语句
#define FatalError printf//添加的语句
#define Error printf//添加的语句

typedef int ElementType;
typedef struct TreeNode * Position;
typedef struct TreeNode * SearchTree;
SearchTree Insert(ElementType X,SearchTree T);
SearchTree Delete(ElementType X,SearchTree T);
Position FindMin(SearchTree T);//Searchtree修改为SearchTree
struct TreeNode
{
ElementType Element;
SearchTree Left;
SearchTree Right;
};

struct TreeNode * creat (void)
{
SearchTree root;
ElementType X;

printf("input records:\n");
scanf("%d",&X);
while(X!=NULL)
{
root=Insert(X,root);
printf("input the inserted number:"); //print修改为printf
scanf("%d",&X);//Scanf修改为scanf
}
return root;
}

SearchTree Insert(ElementType X,SearchTree T)
{
if(T==NULL)
{
//T=malloc(sizeof(struct TreeNode));
T=(SearchTree)malloc(sizeof(struct TreeNode));
if(T==NULL)
FatalError("Out of space!!!");
else
{
T->Element =X;
T->Left =T->Right = NULL;
}
}
else
if(X<T->Element)
T->Left = Insert(X,T->Left);
else
if(X>T->Element)
T->Right=Insert(X,T->Right);
return T;
}

SearchTree Delete(ElementType X,SearchTree T)
{
Position TmpCell; //position修改为Position

if(T==NULL)
Error("Element not found");
else
if(X<T->Element)
T->Left = Delete(X,T->Left);
else
if(X>T->Element)
T->Right = Delete(X,T->Left);
else
if(T->Left && T->Right)
{TmpCell = FindMin(T->Right);
T->Element = TmpCell->Element;
T->Right = Delete(T->Element,T->Right);
}
else
{TmpCell = T;
if(T->Left == NULL)
T = T->Right;
else if(T->Right == NULL)
T=T->Left;
free(TmpCell);}
return T;
}

Position FindMin(SearchTree T) //Searchtree修改为SearchTree
{
if(T !=NULL)
return NULL;
else
if(T->Left==NULL)
return T;
else
return FindMin(T->Left);
}

void preOrder(SearchTree T) //Searchtree修改为SearchTree
{
if(T != NULL)
{
printf("%d ", T->Element);
preOrder(T->Left);
preOrder(T->Right);
}
return;
}

void main()
{
SearchTree root, Left,Right; //;修改为,
ElementType X;

root=creat();
preOrder(root);
printf("input the inserted number:");
scanf("%d",&X); //scanf“%d”,&X);
while(X!=0)//(X!==Null)
{
root=Insert(X,root);
preOrder(root);
printf("input the inserted number:");
scanf("%d",&X); //scanf“%d”,&X);
}
printf("input the deleted number:"); //printf（"input the deleted number:");
scanf("%d",&X); //scanf(“%d”,&X);
while(X!=0)//(X!==Null)
{
root=Delete(X,root);
preOrder(root);
printf("input the deleted number:"); //printf（"input the deleted number:");
scanf("%d",&X); //scanf(“%d”,&X);
}
}

Answer 2

//---------------------------------------------------------------------------

#include <stdio.h>
#include <stdlib.h>

typedef struct NODE{
int data;
struct NODE *rn,*ln;
} node;

node *BST(node *a,int b) /*创建排序二叉树*/
{
if (a==NULL) {
a=malloc(sizeof(node));
a->data =b;
a->rn=a->ln=NULL;
}
else if (b>=a->data ) {
a->ln=BST(a->ln,b);
}
else a->rn=BST(a->rn,b);
return a;
}

void prt(node *a)/*中序遍历，用于输出排序结果*/
{
if (a!=NULL) {
prt(a->rn);
printf("%d\t",a->data );
prt(a->ln );
}
}

void del(node *a)/*释放空间*/
{
if (a!=NULL) {
del(a->rn);
del(a->ln);
}
free(a);
}
int main(void)
{
node *bst=NULL;
int i=-1;
do{ /*这个循环用于读取整数，并生成二叉排序树*/
scanf("%d",&i);
if (i==-104) break; /*终止读取条件是读取到的数字是-104*/
bst=BST(bst,i);
}while (1);

prt(bst); /*输出二叉树*/
del(bst); /*删除二叉树，释放空间*/
return 0;
}
//---------------------------------------------------------------------------