mirror of
https://gitee.com/apaki/unicstl.git
synced 2025-05-18 03:51:35 +08:00
100 lines
2.3 KiB
C
100 lines
2.3 KiB
C
/**
|
|
* @file tree.h
|
|
* @author wenjf (Orig5826@163.com)
|
|
* @brief
|
|
* @version 0.1
|
|
* @date 2024-06-23
|
|
*
|
|
* @copyright Copyright (c) 2024
|
|
*
|
|
*/
|
|
#ifndef _TREE_H_
|
|
#define _TREE_H_
|
|
|
|
#include "common.h"
|
|
|
|
typedef enum {
|
|
RBT_RED = 0x00,
|
|
RBT_BLACK = 0x01,
|
|
}rbt_color;
|
|
|
|
struct _tree_node
|
|
{
|
|
void *obj;
|
|
struct _tree_node * left;
|
|
struct _tree_node * right;
|
|
struct _tree_node * parent;
|
|
|
|
union
|
|
{
|
|
int32_t balance;
|
|
uint32_t color;
|
|
};
|
|
};
|
|
|
|
struct _tree
|
|
{
|
|
struct _tree_node * _root;
|
|
|
|
uint32_t _size; // 栈大小
|
|
uint32_t _obj_size; // 元素大小
|
|
uint32_t _capacity; // 总容量
|
|
uint32_t _ratio; // 扩展比率
|
|
|
|
bool _right_priority; // 右优先
|
|
|
|
// kernel
|
|
bool (*insert)(struct _tree* self, void* obj);
|
|
bool (*delete)(struct _tree* self, void* obj);
|
|
|
|
struct _tree_node* (*find)(struct _tree* self, void* obj);
|
|
struct _tree_node* (*find_min)(struct _tree* self, struct _tree_node* root);
|
|
struct _tree_node* (*find_max)(struct _tree* self, struct _tree_node* root);
|
|
|
|
bool (*rebalance)(struct _tree* self, struct _tree_node* root);
|
|
int32_t (*height)(struct _tree* self, struct _tree_node* root);
|
|
|
|
bool (*min)(struct _tree* self, void* obj);
|
|
bool (*max)(struct _tree* self, void* obj);
|
|
|
|
bool (*clear)(struct _tree* self);
|
|
bool (*empty)(struct _tree* self);
|
|
uint32_t (*size)(struct _tree* self);
|
|
|
|
/**
|
|
* @brief obj compare with obj2
|
|
*
|
|
* @return
|
|
* obj < obj2 return -1
|
|
* obj == obj2 return 0
|
|
* obj > obj2 return 1
|
|
*/
|
|
int (*compare)(void* obj, void* obj2);
|
|
|
|
// free
|
|
void (*destory)(struct _tree* self);
|
|
|
|
// ----- print -----
|
|
// traversal depth
|
|
void (*order)(struct _tree* self, bool right_priority);
|
|
|
|
void (*preorder)(struct _tree* self, struct _tree_node* root);
|
|
void (*inorder)(struct _tree* self, struct _tree_node* root);
|
|
void (*postorder)(struct _tree* self, struct _tree_node* root);
|
|
// traversal breadth
|
|
void (*breadth)(struct _tree* self, struct _tree_node* root);
|
|
|
|
void (*print_obj)(void* obj);
|
|
};
|
|
typedef struct _tree* tree_t;
|
|
|
|
// bst_tree
|
|
bool tree_avl_init(struct _tree *self, uint32_t obj_size);
|
|
bool tree_rb_init(struct _tree *self, uint32_t obj_size);
|
|
|
|
tree_t tree_new(void);
|
|
void tree_free(tree_t tree);
|
|
|
|
#endif // _TREE_H_
|
|
|