This is a C implementation of a binary search tree. It supports int numbers, although (using void pointers) it could be used with any value or structure. This was done just to brush up on my C knowledge. I plan to implement a RB Tree when I finish the bst implementation.
This project is build using cmake. To build:
- From the root of the project, create a dir named
build
and cd into it. - Type in a terminal
cmake ..
to create the makefiles for your platform. - Type
make .
to build the project in to the current dir.
To use this bst, include the bst.h
file into your source code. All
functions imported from that source file start with bst_
(ex.
bst_create_tree(tree);
).
- eliminate key method
- debump method, to eliminate capacity of the nodes array
- queue data structure to be able to do breadth first search
- calculate tree height method
- finish implementing queue structure to handle BFS