bstree.h

来自「红黑树和二叉查找树数据结构的实现以及二者的性能比较的C语言实现代码」· C头文件 代码 · 共 36 行

#ifndef BSTREE_H
#define BSTREE_H


typedef int bsKEY;
typedef struct bsTreeNode *bsTreeNode;
typedef struct bsTree *bsTree;

typedef void (*bsProcess) (bsTreeNode);
typedef void (*bsVisit) (bsTreeNode,bsProcess);


bsTree BS_NewTree();
bsTree BS_Insert(bsTree T, bsKEY bskey);
bsTree BS_Delete(bsTree T, bsKEY bskey);
bsTreeNode BS_Search(bsTreeNode x, bsKEY bskey);
bsTreeNode BS_Search_Iterative(bsTreeNode x, bsKEY bskey);
bsTreeNode BS_SearchInTree(bsTree T, bsKEY key);
bsTreeNode BS_Search_IterativeInTree(bsTree T, bsKEY key);
bsTreeNode BS_Minimum(bsTreeNode x);
bsTreeNode BS_Maximum(bsTreeNode x);
bsTreeNode BS_Successor(bsTreeNode x);
bsTreeNode BS_Predecessor(bsTreeNode x);
void BS_Pre_Visit(bsTreeNode node, bsProcess process);
void BS_In_Visit(bsTreeNode node, bsProcess process);
void BS_Post_Visit(bsTreeNode node, bsProcess process);
void BS_Pre_Disply(bsTreeNode node, bsProcess process);
void BS_Free_Node(bsTreeNode node);
void BS_Print_Node(bsTreeNode node);
void BS_Displiy_Tree(bsTree T, bsVisit visit);
void BS_Delete_Tree(bsTree T, bsVisit visit);
bsTree BS_NewTree_Rand(int a[], int n);
//void newRandArray(int a[], int nMinNum, int nCount); 

#endif