c语言平衡二叉树,C语言平衡二叉树 AVL实现代码

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

下面是头文件内容

------------------------------------------------------------------------

#ifndef TREE_H

#define TREE_H

#include

typedef struct TREE__ *TREE;

// 回调函数原型

typedef VOID (*TREE_KEY_DESTROY)(PVOID Key);

typedef INT (*TREE_KEY_COMPARE)(PVOID Dest, PVOID Source);

typedef BOOL (*TREE_KEY_TRAVERSE)(PVOID Key, PVOID Param);

// 创建树

TREE

Tree_Create(

VOID

);

// 销毁树

VOID

Tree_Destroy(

TREE Tree,

TREE_KEY_DESTROY Destroy

);

// 插入数据(允许数据重复)

BOOL

Tree_Insert(

TREE Tree,

PVOID Key,

TREE_KEY_COMPARE Compare

);

// 删除数据

BOOL

Tree_Delete(

TREE Tree,

PVOID Key,

TREE_KEY_COMPARE Compare,

TREE_KEY_DESTROY Destroy

);

// 对每个数据调用Traverse函数

BOOL

Tree_Traverse(

TREE Tree,

TREE_KEY_TRAVERSE Traverse,

PVOID Param

);

// 查找数据

PVOID

Tree_Find(

TREE Tree,

PVOID Key,

TREE_KEY_COMPARE Compare

);

// 获取树的高度

DWORD

Tree_High(

TREE Tree

);

#endif