4-12 二叉搜索树的操作集 (30分)

4-12 二叉搜索树的操作集   (30分)

本题要求实现给定二叉搜索树的5种常用操作。

函数接口定义：

BinTree Insert( BinTree BST, ElementType X );
BinTree Delete( BinTree BST, ElementType X );
Position Find( BinTree BST, ElementType X );
Position FindMin( BinTree BST );
Position FindMax( BinTree BST );

其中BinTree结构定义如下：

typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

• 函数Insert将X插入二叉搜索树BST并返回结果树的根结点指针；
• 函数Delete将X从二叉搜索树BST中删除，并返回结果树的根结点指针；如果X不在树中，则打印一行Not Found并返回原树的根结点指针；
• 函数Find在二叉搜索树BST中找到X，返回该结点的指针；如果找不到则返回空指针；
• 函数FindMin返回二叉搜索树BST中最小元结点的指针；
• 函数FindMax返回二叉搜索树BST中最大元结点的指针。

裁判测试程序样例：

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

typedef int ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

void PreorderTraversal( BinTree BT ); /* 先序遍历，由裁判实现，细节不表 */
void InorderTraversal( BinTree BT );  /* 中序遍历，由裁判实现，细节不表 */

BinTree Insert( BinTree BST, ElementType X );
BinTree Delete( BinTree BST, ElementType X );
Position Find( BinTree BST, ElementType X );
Position FindMin( BinTree BST );
Position FindMax( BinTree BST );

int main()
{
    BinTree BST, MinP, MaxP, Tmp;
    ElementType X;
    int N, i;

    BST = NULL;
    scanf("%d", &N);
    for ( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Insert(BST, X);
    }
    printf("Preorder:"); PreorderTraversal(BST); printf("\n");
    MinP = FindMin(BST);
    MaxP = FindMax(BST);
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        Tmp = Find(BST, X);
        if (Tmp == NULL) printf("%d is not found\n", X);
        else {
            printf("%d is found\n", Tmp->Data);
            if (Tmp==MinP) printf("%d is the smallest key\n", Tmp->Data);
            if (Tmp==MaxP) printf("%d is the largest key\n", Tmp->Data);
        }
    }
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Delete(BST, X);
    }
    printf("Inorder:"); InorderTraversal(BST); printf("\n");

    return 0;
}
/* 你的代码将被嵌在这里 */

输入样例：

10
5 8 6 2 4 1 0 10 9 7
5
6 3 10 0 5
5
5 7 0 10 3

输出样例：

Preorder: 5 2 1 0 4 8 6 7 10 9
6 is found
3 is not found
10 is found
10 is the largest key
0 is found
0 is the smallest key
5 is found
Not Found
Inorder: 1 2 4 6 8 9

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

typedef int ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

//void PreorderTraversal( BinTree BT ); /* 先序遍历，由裁判实现，细节不表 */
//void InorderTraversal( BinTree BT );  /* 中序遍历，由裁判实现，细节不表 */

BinTree Insert( BinTree BST, ElementType X );
BinTree Delete( BinTree BST, ElementType X );
Position Find( BinTree BST, ElementType X );
Position FindMin( BinTree BST );
Position FindMax( BinTree BST );

int main()
{
    BinTree BST, MinP, MaxP, Tmp;
    ElementType X;
    int N, i;

    BST = NULL;
    scanf("%d", &N);
    for ( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Insert(BST, X);
    }
  //  printf("Preorder:"); PreorderTraversal(BST); printf("\n");
    MinP = FindMin(BST);
    MaxP = FindMax(BST);
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        Tmp = Find(BST, X);
        if (Tmp == NULL) printf("%d is not found\n", X);
        else {
            printf("%d is found\n", Tmp->Data);
            if (Tmp==MinP) printf("%d is the smallest key\n", Tmp->Data);
            if (Tmp==MaxP) printf("%d is the largest key\n", Tmp->Data);
        }
    }
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Delete(BST, X);
    }
   // printf("Inorder:"); InorderTraversal(BST); printf("\n");

    return 0;
}

BinTree Insert(BinTree BTS ,ElementType X)
{
	if(!BTS)
	{
		BTS = (BinTree)malloc(sizeof(struct TNode));/*生成一个新结点*/
		BTS->Data = X;
		BTS->Left = BTS->Right = NULL;
	}
	else
	{
		if(X < BTS->Data)
		{
			BTS->Left = Insert(BTS->Left,X);/*递归插入左子树*/
		}
		else if(X > BTS->Data)
		{
			BTS->Right = Insert(BTS->Right,X);/*递归插入右子树*/
		}
		/*如果 Ｘ　已经存在，则什么也不做*/
	}
	return BTS;
}

Position Find(BinTree BTS,ElementType X)
{
	while(BTS)
	{
		if(X < BTS->Data)
		{
			BTS = BTS->Left;
		}
		else if(X > BTS->Data)
		{
			BTS = BTS->Right;
		}
		else
		{
			return BTS;
		}
	}
	return NULL;
}

Position FindMin(BinTree BTS)
{
	if(!BTS)
	{
		return NULL;	
	}
	else if(!BTS->Left)
	{
		return BTS;
	}
	else
	{
		return FindMin(BTS->Left);
	}
}

Position FindMax(BinTree BTS)
{
	if(BTS)
	{
		while(BTS->Right)
		{
			BTS = BTS->Right;
		}
	}
	return BTS;
}

BinTree Delete(BinTree BTS,ElementType X)
{
	Position Tmp;
	if(!BTS)
	{
		printf("Not Found\n");
	}
	else
	{
		if(X < BTS->Data)/*从左子树递归删除*/
		{
			BTS->Left = Delete(BTS->Left,X);
		}
		else if(X > BTS->Data)/*从右子树递归删除*/
		{
			BTS->Right = Delete(BTS->Right,X);
		}
		else/*当前的BTS就是要删除的结点*/ 
		{
			if(BTS->Left && BTS->Right)/*要被删除的结点有左右两个子结点，就从右子树中找最小的数填充删除的结点*/
			{
				Tmp = FindMin(BTS->Right);
				BTS->Data = Tmp->Data;
				BTS->Right = Delete(BTS->Right,BTS->Data);/*又从右结点删除最小的数的结点*/ 
			}
			else/*只有一个子结点或没有子结点*/
			{
				Tmp = BTS;
				if(!BTS->Left)/*只有右结点*/
				{
					BTS = BTS->Right;
				}
				else if(!BTS->Right)/*只有左结点*/ 
				{
					BTS = BTS->Left;
				}
				free(Tmp);
			}
		}
	}
	return BTS;
}