How helixgen/datastructures works
This repository is a collection of independent C data-structure and algorithm demonstrations, not a single application with a shared user-to-result pipeline. Each source file contains its own implementation area; sampled files also show local main examples. The README is empty, and the file tree and excerpts do not establish calls or data flow between files, so the graph keeps them independent and omits inter-file edges.
Components 15
Arrays and text
- Array operations
Array.c - String algorithms
Strings.c
Linked lists
- Linked list
LinkedList.c - Doubly linked list
DoublyLinkedList.c - Circular linked list
CircularLinkedList.c
Queues and stacks
- Queue
Queues.c - Circular queue
CircularQueue.c - Double-ended queue
Dequeue.c - Stack variants
Stack.c - Bracket validation
Stack2.c - Expression evaluation
Stack3.c
Trees and matrices
- Binary search tree
BinarySearchTrees.c - Tree traversals
Trees.c - Special matrices
Matrices.c - Recursion examples
Recursion.c