An implementation of binary search trees / RBtrees in C23 that should be decently portable.
- C 97.1%
- Makefile 2.9%
Evalyn Goemer
44ec74e53e
Also upstream initalizer macros & struct changes to make things nicer to work with from EvalynOS |
||
|---|---|---|
| .clangd | ||
| .gitignore | ||
| bstree.c | ||
| bstree.h | ||
| LICENCE.txt | ||
| main.c | ||
| Makefile | ||
| rbtree.c | ||
| rbtree.h | ||
| README.md | ||
Freestanding Trees
An implementation of binary search trees / RBtrees in C23 that should be decently portable.
The trees are intrusive data stuctures
Look at main.c and bstree.h for how to use
rbtree.h is more of a private header and the main interface resides in bstree.h and if the tree type is properly set to an rbtree
it will invoke the proper functions to balance and keep it balanced.
You should not change the type of a non empty tree.