【C语言】20191018 二叉查找树的实现

数据结构——二叉查找树

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

typedef struct TreeNode
{
	int data;
	struct TreeNode* left;
	struct TreeNode* right;
}TreeNode;

typedef struct TreeNode* Position;
typedef struct TreeNode* SearchTree;

TreeNode* CreateNode(int X, TreeNode* left, TreeNode* right)//创建新节点
{
	TreeNode* p;

	p = (TreeNode*)malloc(sizeof(TreeNode));

	if (p == NULL)
		printf("分配内存空间失败！");

	p->data = X;
	p->left = left;
	p->right = right;

	return p;
}

TreeNode* Find(int X, SearchTree T)//递归查找二叉查找树中的X元素
{
	if (T == NULL)
		return NULL;

	if (X < T->data)//如果X小于当前节点的元素值
		return Find(X, T->left);//继续向左查找
	else if (X > T->data)//如果X大于当前节点的元素值
		return Find(X, T->right);//继续向右查找
	else
		return T;
}

TreeNode* FindMin(SearchTree T)//递归查找最小值
{
	if (T == NULL)
		return NULL;
	else if (T->left == NULL)
		return T;
	else
		return FindMin(T->left);//继续向左查找
}

TreeNode* FindMax(SearchTree T)//非递归查找最大值
{
	if (T != NULL)
		while (T->right != NULL)
			T = T->right;//继续向右查找
	return T;
}

TreeNode* Insert(int X, SearchTree T)//递归将元素X插入树中
{
	if (T == NULL)//若T为空
	{
		T = (TreeNode*)malloc(sizeof(TreeNode));//分配内存空间

		if (T == NULL)
			printf("分配内存空间失败！");
		else
		{
			T->data = X;//将元素X存入T中即可
			T->left = T->right = NULL;
		}
	}
	else if (X < T->data)//若X小于当前元素
		T->left = Insert(X, T->left);//继续向左
	else if (X > T->data)//若X大于当前元素
		T->right = Insert(X, T->right);//继续向右
	else
		printf("该节点已存在！");

	return T;
}

TreeNode* Delete(int X, SearchTree T)//递归删除元素X
{
	Position p;//定义一个临时节点p

	if (T == NULL)
		printf("未找到该元素！");
	else if (X < T->data)//若X小于当前节点元素值
		T->left = Delete(X, T->left);//继续向左寻找
	else if (X > T->data)//若X大于当前节点元素值
		T->right = Delete(X, T->right);//继续向右寻找
	else if (T->left && T->right)//找到X后，若X既有左子树，也有右子树
	{
		p = FindMin(T->right);//找到右子树中的最小值所在节点p
		T->data = p->data;//用p的元素值覆盖X值
		T->right = Delete(T->data, T->right);
	}
	else//若X只有一个儿子或没有儿子
	{
		p = T;
		if (T->left == NULL)//若T没有左儿子
			T = T->right;//让T指向T的右儿子
		else if (T->right == NULL)//若T没有右儿子
			T = T->left;//让T指向T的左儿子
		free(p);
	}
	
	return T;
}

void Display(SearchTree T,int X,int direction)//打印二叉查找树
{
	if (T != NULL)
	{
		if (direction == 0)
			printf("%d是根节点\n", X);
		else
		{
			if (direction == 1)
				printf("%d是%d的%s儿子\n", T->data, X, "右");
			else
				printf("%d是%d的%s儿子\n", T->data, X, "左");
		}

		Display(T->left, T->data, -1);
		Display(T->right, T->data, 1);
	}
}

void main()
{
	int i;
	SearchTree T = NULL;

	printf("依次添加：\n");

	for (i = 0; i < 10; i++)
	{
		printf("%d", i);
		T = Insert(i, T);
	}
	printf("\n");

	printf("树的详细信息：\n");

	Display(T, T->data, 0);
}