Algorithm:BST(Binary Search Tree)构造

最新推荐文章于 2024-09-14 22:25:23 发布

「已注销」

最新推荐文章于 2024-09-14 22:25:23 发布

阅读量951

点赞数

分类专栏： Algorithm 文章标签： BST 算法数据结构

本文链接：https://blog.csdn.net/u011056389/article/details/16926539

版权

Algorithm 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

二叉搜索树的构造

#include <conio.h>
//BSTree
typedef struct BSTree
{
	int m_nValue;
	struct BSTree *m_left;
	struct BSTree *m_right;
}Tree;
Tree *CreateBSTree(int *array_list,int nLength);
void CreateBSTree(Tree *root,int nNode);
void PrintTreeNode(Tree *root);
void CreateBSTree(Tree *root,int nNode)
{
	ASSERT(root!=NULL && nNode!=root->m_nValue);
	if (nNode<root->m_nValue)
	{
		if (root->m_left==NULL)
		{
			Tree *node=new Tree();
			node->m_left=NULL;
			node->m_right=NULL;
			node->m_nValue=nNode;
			root->m_left=node;
		}
		else
		{
			CreateBSTree(root->m_left,nNode);
		}
	}
	else if (nNode>root->m_nValue)
	{
		if (root->m_right==NULL)
		{
			Tree *node=new Tree();
			node->m_left=NULL;
			node->m_right=NULL;
			node->m_nValue=nNode;
			root->m_right=node;
		}
		else 
		{
			CreateBSTree(root->m_right,nNode);
		}
	}
}
Tree *CreateBSTree(int *array_list,int nLength)
{
	Tree *root=NULL;
	ASSERT(nLength>0);
	root=new Tree();
	root->m_nValue=array_list[0];
	root->m_left=NULL;
	root->m_right=NULL;
	for (int i=1;i<nLength;i++)
	{
		CreateBSTree(root,array_list[i]);
	}
    return root;
}
void PrintTreeNode(Tree *root)
{
	if (!root)
	{
		return ;
	}
	PrintTreeNode(root->m_left);
	_cprintf("  %d  \n",root->m_nValue);
	PrintTreeNode(root->m_right);
}
void Run()
{
	AllocConsole();
	_cprintf("Output:\n");
	int nNumList[]={6,7,34,67,12,54,98,0,2,4,61};
	int nLength=7;

	Tree *root=NULL;
	root=CreateBSTree(nNumList,nLength);
	PrintTreeNode(root);
}