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

typedef struct BiTree
{
    int elem;
    struct BiTree *Lchild;
    struct BiTree *Rchild;
}BiNode;

void BiT_Create(BiNode *T,int x)
{
    BiNode *Temp;
    BiNode *New;

    Temp=T;
    if(T->elem==-1)
    {
        T->elem=x;
        T->Lchild=NULL;
        T->Rchild=NULL;
        return;
    }
    else if(Temp->elem>=x)
    {
        if(Temp->Lchild==NULL)
        {
            if((New=(BiNode*)malloc(sizeof(BiNode)))!=NULL)
            {
                New->elem=x;
                New->Lchild=NULL;
                New->Rchild=NULL;
                Temp->Lchild=New;
            }
        }
        else
            BiT_Create(Temp->Lchild,x);
    }
    else
    {
        if(Temp->Rchild==NULL)
        {
            if((New=(BiNode*)malloc(sizeof(BiNode)))!=NULL)
            {
                New->elem=x;
                New->Lchild=NULL;
                New->Rchild=NULL;
                Temp->Rchild=New;
            }
        }
        else
            BiT_Create(Temp->Rchild,x);
    }
}
void BiT_Init(BiNode *T,int array[],int size)
{
    int i;
    for(i=0;i<size;i++)
        BiT_Create(T,array[i]);
}

void BiT_Print(BiNode *T)
{
    BiNode *Temp;
    Temp=T;
    if(!Temp)
        return;

    BiT_Print(Temp->Lchild);
    printf("%d;",Temp->elem);
    BiT_Print(Temp->Rchild);

}
int BiT_Search(BiNode *T,int x,int size)
{
    int i=0;
    BiNode *Temp;
    Temp=T;
    if(i<size)
    {
        if(Temp->elem==x)
            return 1;
        else if(Temp->elem>=x&&Temp->Lchild!=NULL)
            BiT_Search(Temp->Lchild,x,size);
        else if(Temp->elem<x&&Temp->Rchild!=NULL)
            BiT_Search(Temp->Rchild,x,size);
        else
            return 0;
    }

}

void BiT_Delete(BiNode *T)
{
    BiNode *Temp;
    BiNode *Trans;
    Temp=T;
    if(Temp->Lchild==NULL)
    {
        T=T->Rchild;
        free(Temp);
    }
    else if(Temp->Rchild==NULL)
    {
        T=T->Lchild;
        free(Temp);
    }
    else
    {   
        Trans=T->Lchild;
        while(Trans->Rchild)
        {
            Temp=Trans;
            Trans=Trans->Rchild;
        }
        T->elem=Trans->elem;
        if(Temp!=T)
            Temp->Rchild=Trans->Rchild;
        else
            Temp->Lchild=Trans->Lchild;
        free(Trans);
    }
}

int BiT_Delenode(BiNode *T,int x)
{
    BiNode *Temp;
    Temp=T;

    if(!Temp)
        return 0;
    else
    {
        if(Temp->elem==x)
        {
            BiT_Delete(Temp);
            return 1;
        }
        else if(Temp->elem>x)
            BiT_Delenode(Temp->Lchild,x);
        else
            BiT_Delenode(Temp->Rchild,x);
    }
}

   

void main()
{
    BiNode *T;
    int *array;
    int size;
    int i;

    printf("Input the size of the ARRAY:");
    scanf("%d",&size);
    array=(int*)malloc(size*sizeof(int));
    for(i=0;i<size;i++)
    {
        printf("Input the elem of No.%d in the ARRAY:",i);
        scanf("%d",&array[i]);
    }
    T=(BiNode*)malloc(sizeof(BiNode));
    T->elem=-1;
    T->Lchild=NULL;
    T->Rchild=NULL;
    BiT_Init(T,array,size);
    BiT_Delenode(T,3);
    BiT_Print(T);
    BiT_Search(T,2,size);
    free(T);
}
为什么在执行int BiT_Delenode(BiNode *T,int x)的时候会报read的溢出错误？求解.......

补充一下除了那两段以Del开头的函数其他的都已经测试过可以运行了，估计就是在那里出的问题

我写的这个是二叉排序树，那个删除的算法是在书上找的伪指令自己补上的，逻辑应该没问题但是就不知道是哪里出问题了....

恩，就是这个地方执行了delet以后print就不听话了....我纠结了半天也没找到错误....

最近写个程序刚好要用到二叉树的知识，我现在正在恶补

俺也是啊.....红黑树简直就是噩梦啊.....掩面泪奔....

节点删除有问题，想想链表怎么删除吧，要知道被删除的前驱节点。
      T=T->Rchild;
只用这个是不行的。
void BiT_Delete(BiNode *pre,BiNode *T)
{
    BiNode *Temp;
    BiNode *Trans;
    Temp=T;
    if(Temp->Lchild==NULL)
    {
        if(Temp==pre->Lchild)
            pre->Lchild=Temp->Rchild;
        else
            pre->Rchild=Temp->Rchild;
        free(Temp);
    }
    else if(Temp->Rchild==NULL)
    {
        if(Temp==pre->Lchild)
            pre->Lchild=Temp->Lchild;
        else
            pre->Rchild=Temp->Lchild;
        free(Temp);
    }
    else
    {   
        Trans=T->Lchild;
        while(Trans->Rchild)
        {
            Temp=Trans;
            Trans=Trans->Rchild;
        }
        T->elem=Trans->elem;
        if(Temp!=T)
            Temp->Rchild=Trans->Rchild;
        else
            Temp->Lchild=Trans->Lchild;
        free(Trans);
    }
}

int BiT_Delenode(BiNode *pre,BiNode *T,int x)
{
    BiNode *Temp;
    Temp=T;

    if(!Temp)
        return 0;
    else
    {
        if(Temp->elem==x)
        {
            BiT_Delete(pre,Temp);
            return 1;
        }
        else if(Temp->elem>x)
            BiT_Delenode(T,Temp->Lchild,x);
        else
            BiT_Delenode(T,Temp->Rchild,x);
    }
}
时间不够只改了待删除节点有一个子节点的