二叉查找树的建立，插入，删除例程

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

typedef struct TreeNode{
    int value;
    struct TreeNode* Left;
    struct TreeNode* Right;
}TreeNode;

void printTree(TreeNode* T, int depth);

TreeNode *Insert(TreeNode* T, int val)
{
    if (!T)
    {
        TreeNode * T = (TreeNode*)malloc(sizeof(TreeNode));
        //int val;
        if (T == NULL)
        {
            printf("out of space!!!
");
            return NULL;
        }
        T->value = val;
        T->Left = T->Right = NULL;
        return T;
    }
    else
     
        if (val < T->value)
            T->Left = Insert(T->Left, val);
        else if (val > T->value)
            T->Right = Insert(T->Right, val);
        return T;
    
    

    

}

void InOrderTraversal(TreeNode* T, int depth)
{
    if (T)
    {
        InOrderTraversal(T->Left, depth + 1);
        printTree(T, depth);
        InOrderTraversal(T->Right, depth + 1);
    }
}

void printTree(TreeNode* T, int depth)
{
    while (depth--)
        printf("  ");
    printf("%d
", T->value);
}

TreeNode* FinMin(TreeNode* T)
{
    
    if (T == NULL)
    {
        printf("the tree is empty!
");
        return NULL;
    }
    while (T->Left)
        T = T->Left;
    return T;
}

TreeNode *Delete(TreeNode *T, int val)
{
    TreeNode * temp;
    if (T == NULL)
    {
        printf("The tree is empty!!!
");
        return NULL;
    }
    else
    if (val > T->value)
        T->Right = Delete(T->Right, val);
    else
    if (val < T->value)
        T->Left = Delete(T->Left, val);
    else if (T->Left &&T->Right)
    {
        temp = FinMin(T -> Right);
        T->value = temp->value;
        T->Right = Delete(T->Right, temp->value);
    }
    else
    {
        temp = T;
        if (!T->Left)
            T = T->Right;
        else

        if (!T->Right)
            T = T->Left;
        free(temp);

    }
    return T;
}

int main()
{
    TreeNode *T = NULL;
    TreeNode *T2 = NULL;
    int val;
    /*scanf_s("%d", &val);
    T->value = val;*/
    //T->Left = T->Right = NULL;
    for (int i = 0; i < 6; i++)
    {
        scanf_s("%d", &val);
        T = Insert(T, val);
    }
    InOrderTraversal(T, 0);
    printf("After Insertintg:
");
    //scanf_s("%d", &val);
    T = Insert(T, 5);

    InOrderTraversal(T, 0);

    T2 = FinMin(T);
    printf("
%d
", T2->value);

    printf("
After deleting:
");
    Delete(T, 6);
    InOrderTraversal(T, 0);

    return 0;
}