myapp4.cpp

来自「数据结构的一些比较经典的程序,适合刚学的人,里面的一些程序都是比较常用的」· C++ 代码 · 共 94 行

// myApp4.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "stdlib.h"
#include "malloc.h"
#include "stdio.h"


#define MAXNODE 8

typedef struct _treeNode {
	int data;
	_treeNode* lChild;
	_treeNode* rChild;
}treeNode;

treeNode* getNode(int value)
{
	treeNode* pNode = (treeNode*)malloc(sizeof(treeNode));
	pNode->lChild = NULL;
	pNode->rChild = NULL;
	pNode->data = value;
	
	return pNode;
};

void insertNode(treeNode** ppRoot,treeNode* child)
{
	if(NULL == (*ppRoot))
	{
		(*ppRoot) = child;
	}
	else if( (*ppRoot)->data<child->data)
	{
		insertNode(&((*ppRoot)->rChild),child);
	}
	else
	{
		insertNode(&((*ppRoot)->lChild),child);
	}
};

void initTree( treeNode** ppRoot)
{
	int node[MAXNODE] = {43,32,21,56,23,5,22,87};
	for( int i = 0; i < MAXNODE;i++)
	{
		treeNode* pTmp = getNode(node[i]);
		insertNode(ppRoot,pTmp);
	}
};

void releaseTree(treeNode* root)
{
	if(NULL == root)
	{
		return;
	}

	if( NULL != root->lChild)
	{
		releaseTree(root->lChild);
	}
	if( NULL != root->rChild )
	{
		releaseTree( root->rChild );
	}
	free( root );
};

void sortTree( treeNode* root, int val)
{
	if( NULL == root)
	{
		return;
	}
	sortTree(root->rChild,val);
	if(root->data >= val)
	{
		printf("%d\n",root->data);
		sortTree(root->lChild,val);
	}
};

int main( int argc,char* argv[])
{
	treeNode* root = NULL;
	initTree(&root);
	sortTree( root,22 );
	releaseTree(root);
	return 0;
}