bittree.h

来自「有关二叉树数据结构的C++程序」· C头文件 代码 · 共 37 行

#ifndef _H_BIT_TREE
#define _H_BIT_TREE

#include <string>

typedef struct bittree
{
	char name;
	bittree *parent;
	bittree *leftChild;
	bittree *rightChild;
	

} bitTreeStruct ;

typedef enum
{
	LEFT,
	RIGHT
} childDirect;


bitTreeStruct *pBitTreeHead;

void bitTreeCreate(void);

bitTreeStruct *bitTreeSearch(bitTreeStruct *, char );

bool bitTreeDelete(bitTreeStruct *pNode);

bool bitTreeAddChild(bitTreeStruct *pNode,char name,childDirect direct);

void bitTreePrint(bitTreeStruct *pBitTree);

void bitTreePreRansack(bitTreeStruct *pBitTree);

#endif