BST(一)： insert & find

最新推荐文章于 2024-09-13 22:22:04 发布

melo_bpwzs

最新推荐文章于 2024-09-13 22:22:04 发布

阅读量81

点赞数

文章标签：数据结构

本文链接：https://blog.csdn.net/melo_kuan/article/details/125959903

版权

这篇博客介绍了二叉搜索树（BST）的概念，它是一棵左子树的键小于等于根，右子树的键大于根。文章提供了一个BST的C语言实现，包括创建新节点、插入节点和中序遍历打印的功能。通过示例展示了如何插入一系列整数并进行中序遍历。此外，还包含了查找特定节点的函数，演示了找到节点2及其父节点、左右子节点的键值。

摘要由CSDN通过智能技术生成

BST： binary sear tree，是一颗左子树小于等于根，右子树大于根，这里说的是key，这样的一棵树。从任意节点都满足上面特性。

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


typedef struct stBinary_Search_Tree
{
	int key;
	struct stBinary_Search_Tree* pP;/*指向父节点*/
	struct stBinary_Search_Tree* pL;
	struct stBinary_Search_Tree* pR;
}BST;


BST* bst_new_node(int key)
{
	BST* newNode = (BST*)malloc(sizeof(BST));
	if (newNode == NULL)
	{
		printf("malloc fail for new node: %d \n", key);
		return NULL;
	}

	(void)memset(newNode, 0, sizeof(BST));
	newNode->key = key;
	return newNode;
}


/*处理一个节点插入到某二叉树中，就是单纯的插入，
不负责某某节点在不在的查找逻辑*/
void bst_insert(BST** ppTree, BST* pNewNode)
{
	BST* pTree = *ppTree;
	BST* pLoopNode = pTree;
	BST* pParentNode = pTree;

	while (pLoopNode)
	{
		pParentNode = pLoopNode;
		if (pLoopNode->key >= pNewNode->key)
		{
			pLoopNode = pLoopNode->pL;
		}
		else
		{
			pLoopNode = pLoopNode->pR;
		}
	}

	/*1 维护子父关系*/
	pNewNode->pP = pParentNode;

	/*2 parent为空说明是空树，维护父子关系*/
	if (pParentNode == NULL)
	{
		*ppTree = pNewNode;
	}
	else if (pParentNode->key >= pNewNode->key)
	{
		pParentNode->pL = pNewNode;
	}
	else
	{
		pParentNode->pR = pNewNode;
	}
}


/*中序遍历树打印*/
void bst_inorder_print(BST** ppTree)
{
	BST* pTree = *ppTree;
	if (pTree)
	{
		bst_inorder_print(&pTree->pL);
		printf("%d \t",pTree->key);
		bst_inorder_print(&pTree->pR);
	}
}


BST *bst_find(BST** ppTree, int key)
{
	BST* pTree = *ppTree;
	BST* pLoopNode = pTree;

	while (pLoopNode)
	{
		if (pLoopNode->key == key)
		{
			return pLoopNode;
		}
		else if (pLoopNode->key > key)
		{
			pLoopNode = pLoopNode->pL;
		}
		else
		{
			pLoopNode = pLoopNode->pR;
		}
	}

	return pLoopNode;
}


BST* g_bst_tree = NULL;

void test_bst_insert_and_find()
{
	int arr[] = { 4,2,5,1,3 };
	/*
	       4
		2     5
	  1   3
	*/
	for (int i = 0; i < sizeof(arr) / sizeof(arr[0]); i++)
	{
		BST* pNewNode = bst_new_node(arr[i]);
		bst_insert(&g_bst_tree,pNewNode);
	}
	printf("bst inorder print\n");
	bst_inorder_print(&g_bst_tree);
	printf("\n");

	BST* findNode = bst_find(&g_bst_tree,2);
	printf("node 2 parent is %d (should 4) \n",findNode->pP->key);
	printf("node 2 pL is %d (should 1) pR is %d (should 3) \n", findNode->pL->key, findNode->pR->key);
}


int main()
{
	test_bst_insert_and_find();
	return 0;
}