C Data Structures & Algorithms Kit

Clean, heavily commented C11 reference implementations of 12 data structure and algorithm families (dynamic array, linked lists, stack, queue, BST, AVL, heap, hash table, graph, sorting, searching) with a demo and unit tests for every module, plus a 23-page PDF study guide with diagrams, Big-O tables, common bugs and exercises. Builds with zero warnings using make or CMake. For learning and reference. Instant download.

Learn data structures by reading code that is correct, tested and explained.

Most data structures courses ask you to implement a linked list or an AVL tree in C and give you nothing to compare against. This kit is the reference you wish you had: 12 modules written in clean C11, with beginner-friendly comments on every function (what it does, why, and its Big-O), a runnable demo for each module and a full unit-test suite.

WHAT'S INSIDE

• 12 modules, each with a documented header, an implementation, a demo program and tests:

• (1) Dynamic array (vector) with amortized O(1) growth

• (2) Singly linked list (head + tail, reverse, insert/remove at index)

• (3) Doubly linked list (O(1) removal at both ends)

• (4) Stack in two versions (array and linked) plus a bracket checker

• (5) Circular queue (ring buffer) and growable deque

• (6) Binary search tree: insert, delete (all 3 cases), search, in/pre/post/level-order traversals, height, min/max

• (7) AVL tree with all four rotation cases explained in comments

• (8) Min-heap / priority queue with O(n) heapify

• (9) Hash table with string keys, separate chaining and automatic resizing

• (10) Graph (adjacency list): BFS, DFS, Dijkstra, topological sort, cycle detection

• (11) Seven sorts: bubble, selection, insertion, merge, quick, heap, counting

• (12) Searching: linear, binary (iterative and recursive), lower_bound

• 114 unit tests (about 4,900 checks) using a tiny self-written framework you can read in five minutes. make test runs every suite and prints a summary.

• 12 demo programs that print what each structure is doing.

• PDF study guide (23 pages): for every data structure the concept, an ASCII diagram, operations with Big-O, common bugs and exercise ideas, plus a Big-O cheat sheet, a debugging toolkit and a four-week study plan.

• Makefile and CMake files, README with build instructions for gcc, clang and MSVC.

QUALITY

• C11, compiled with -Wall -Wextra -Wpedantic -std=c11: zero warnings

• Every malloc is checked and every failure returns a clear status code (DSA_ERR_NOMEM, DSA_ERR_RANGE, ...)

• Every allocation is freed (checked with an allocation counter across all 12 test suites)

• Tests cover empty containers, boundary cases, invalid arguments and randomized stress tests

WHO IT IS FOR

• Students in a first data structures / algorithms course

• Self-taught programmers learning C properly

• Anyone preparing for coding interviews who wants to see the structures behind the questions

YOU WILL RECEIVE

One zip file (C_Data_Structures_Kit.zip, about 0.5 MB) containing the full source code (headers, sources, demos, tests), Makefile, CMakeLists.txt, README.md, LICENSE.txt and docs/Guide.pdf.

PLEASE NOTE

• This is a digital product (source code and PDF). Nothing is shipped.

• Intended for learning and reference. Please follow your course's academic-integrity rules; do not submit the code as your own work where that is not allowed.

• Personal / educational single-user license: no redistribution, resale or public posting. See LICENSE.txt.

• Developed and tested with GCC 16.2 (MinGW-w64) on Windows 11, using both make and CMake. The code is standard C11 and should build with other compilers, but only gcc was tested.

• Containers store int values to keep the code easy to read.