bst link

code

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

typedef struct tagBSTNode{
	int iValue;
	struct tagBSTNode *pstLeft;
	struct tagBSTNode *pstRight;
}BST_NODE_S;

static BST_NODE_S *pstRoot;

#define BST_ROOT() \
	pstRoot
#define BST_ROOT_ADDR() \
	&pstRoot

int BST_Insert(int iNum)
{
	int iRet = -1;
	BST_NODE_S *pstCurNode;
	BST_NODE_S **ppstCurLink;
	
	pstCurNode = BST_ROOT();
	ppstCurLink = BST_ROOT_ADDR();
	while (pstCurNode != NULL)
	{
		if (pstCurNode->iValue > iNum)
		{
			ppstCurLink = &(pstCurNode->pstLeft);
			pstCurNode = pstCurNode->pstLeft;
			printf("left: %d ", iNum);
		}	
		else if (pstCurNode->iValue < iNum)
		{
			ppstCurLink = &(pstCurNode->pstRight);
			pstCurNode = pstCurNode->pstRight;
			printf("right: %d ", iNum);
		}	
		else
		{
			printf("Value :%d The Node already exist.", iNum);
			break;
		}
	}	
	printf("\r\n");
	
	if (NULL == pstCurNode)
	{
		pstCurNode = (BST_NODE_S *)malloc(sizeof(BST_NODE_S));
		if (NULL != pstCurNode)
		{
			memset(pstCurNode, 0, sizeof(BST_NODE_S));
			pstCurNode->iValue = iNum;
			printf("add: %d\r\n", pstCurNode->iValue);
			*ppstCurLink = pstCurNode;
			iRet = 0;
		}
	}
	else
	{
		iRet = 0;
	}	

	return iRet;
}

#define BST_ISEMPTY() \
	(pstRoot == NULL)

int BST_PreOrderTraversal(BST_NODE_S *pstRoot)
{
	int iRet = -1;

	if (NULL != pstRoot)
	{
		printf("%d ", pstRoot->iValue);
		BST_PreOrderTraversal(pstRoot->pstLeft);
		BST_PreOrderTraversal(pstRoot->pstRight);
	}
	else
	{
		printf("# ");
	}

	return iRet;
}

int BST_MidOrderTraversal(BST_NODE_S *pstRoot)
{
	int iRet = -1;

	if (NULL != pstRoot)
	{
		BST_MidOrderTraversal(pstRoot->pstLeft);
		printf("%d ", pstRoot->iValue);
		BST_MidOrderTraversal(pstRoot->pstRight);
	}
	else
	{
		printf("# ");
	}

	return iRet;
}

int BST_LastOrderTraversal(BST_NODE_S *pstRoot)
{
	int iRet = -1;
	if (NULL != pstRoot)
	{
		BST_LastOrderTraversal(pstRoot->pstLeft);
		BST_LastOrderTraversal(pstRoot->pstRight);
		printf("%d ", pstRoot->iValue);
	}
	else
	{
		printf("# ");
	}
	
	return iRet;
}

int BST_LevelTraversal(BST_NODE_S *pstRoot)
{
	int iRet = -1;
	return iRet;
}

int main()
{
	int aucInsertNum[7] = {1, 2, 3, 4, 5, 6, 7};
	int i;

	for (i = 0; i < 7; i++)
	{
		BST_Insert(i);
	}
	
	/* printf */
	printf("\r\npre order \r\n");
	BST_PreOrderTraversal(BST_ROOT());

	/* printf */
	printf("\r\nmid order \r\n");
	BST_MidOrderTraversal(BST_ROOT());

	/* printf */
	printf("\r\nlast order \r\n");
	BST_LastOrderTraversal(BST_ROOT());

	/* printf */
	printf("\r\nlast order \r\n");
	BST_LevelTraversal(BST_ROOT());

	return 0;
}

 

运行结果

add: 0
right: 1
add: 1
right: 2 right: 2
add: 2
right: 3 right: 3 right: 3
add: 3
right: 4 right: 4 right: 4 right: 4
add: 4
right: 5 right: 5 right: 5 right: 5 right: 5
add: 5
right: 6 right: 6 right: 6 right: 6 right: 6 right: 6
add: 6

pre order
0 # 1 # 2 # 3 # 4 # 5 # 6 # #
mid order
# 0 # 1 # 2 # 3 # 4 # 5 # 6 #
last order
# # # # # # # # 6 5 4 3 2 1 0