This is a simple realisation of binary search trees with simple optimisation by slow balancing. These trees doesn't implement all needed features, but helps to organize small data arrays in BST. Don't use them for large data arrays (it's very slow, so milliards of data points would hang your computer.
bidirectional_list.c
This is a simple bidirectional connected list.
fifo_lifo.c
Simple FIFO and LIFO organisation.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
pre-alpha version of wiki
Files by names
B-trees.c
This is a simple realisation of binary search trees with simple optimisation by slow balancing. These trees doesn't implement all needed features, but helps to organize small data arrays in BST. Don't use them for large data arrays (it's very slow, so milliards of data points would hang your computer.
bidirectional_list.c
This is a simple bidirectional connected list.
fifo_lifo.c
Simple FIFO and LIFO organisation.