⬅️ C
- LINKED LIST
- SINGLE
- DOUBLE
- CIRCULAR
- MEMORY EFFICIENT DOUBLE LINKED LIST
- UNROLLED LINKED LIST
- SKIP LIST
- MISC
- FIXED ARRAY STACK
- DYNAMIC ARRAY STACK
- LINKED STACK
- MISC
- SIMPLE QUEUE
- FIXED ARRAY
- DYNAMIC ARRAY
- LINKED
- CIRCULAR QUEUE
- FIXED ARRAY
- LINKED
- PRIORITY QUEUE
- FIXED ARRAY
- DYNAMIC ARRAY
- LINKED
-
Depth First Search
-
GENERIC TREES
-
THREADED BINARY TREE
-
XOR TREES
-
BINARY SEARCH TREE
-
AVL TREES
-
RED BLACK TREES
-
SPLAY TREES
-
AUGMENTED TREES
-
SCAPEGOAT TREES
-
INTERVAL TREES
-
HEAP TREE
-
Linear Search
-
Binary Search
- BUBBLE SORT
- SELECTION SORT (UNSTABLE)
- ASCENDING
- DESCENDING
- INSERTION SORT
- ASCENDING
- DESCENDING
Run on terminal using commands below:
gcc sample.c -o sample.out
./sample.out