1 This is just a collection of basic data structures implemented in C. I did these as a refresher of things I've not had to do in a few years. (Why make a dequeue by hand when then STL has a nice one ready to be used?) Thus, the emphasis is on clarity and demonstrating the fundamental technique. Performance and features are not the goal here.

2

3 To build the test programs, run these commands from the top directory of the source tree:

4

5 mkdir build

6 cd build

7 cmake ..

8 make

9

10

11 Included structures:

12

13 Doubly linked list

14 list.h list.c list_test.c

15 Stack

16 stack.h stack.c stack_test.c

17 Ring buffer

18 ring_buffer.h ring_buffer.c ring_buffer_test.c

19 Queue

20 queue.h queue.c queue_test.c

21 Double ended queue

22 dequeue.h dequeue.c dequeue_test.c

23 Priority queue

24 pqueue.h pqueue.c pqueue_test.c

25 Binary search tree

26 bst.h bst.c bst_test.c

27 Red-black tree

28 rbtree.h rbtree.c rbtrree_test.c

29 Order statistic tree

30 ost.h ost.c ost_test.c