How balaji-aiml/data-structure-c works
This repository is a collection of standalone C/C++ algorithm demonstrations, not a single application: users run an individual program to see an algorithm’s output or interact with a data structure. The examples cover sorting, searching, graph and tree algorithms, dynamic programming, scheduling, strings, and data structures. Each program owns its own input, algorithm, and output; no shared runtime or cross-program calls are evidenced. The README is empty. Edges are limited to initiating interactions visible in the supplied excerpts; relationships for other programs were not sampled.
Main entry points: tree_traversals.c Tree traversals · avl_tree_rotations.c AVL rotations · heap_sort.c Heap sort · merge_sort.c Merge sort
Components 21
Sorting
- Heap sort
heap_sort.c - Merge sort
merge_sort.c - Quick sort
quick_sort.c
Data Structures
- Linked list
linked_list.c - Circular linked list
circular_linked_list.c - Doubly linked list
double_linked_list.c - Circular queue
circular_queue.c - Priority queue
priority_queue.c - Hashing
hashing.c - Trie
trie.c - Expression stack
exp_evl_stack.c
Trees and Graphs
- AVL rotations
avl_tree_rotations.c - Tree traversals
tree_traversals.c - Dijkstra shortest paths
dijkstra.c
Other Algorithms
- Binary search
binary_search.c - Dynamic programming
dp.c - FCFS scheduling
fcfs.c - Stack string reversal
string_reverse_using_stack.c - String traversals
string_traversals.c++ - Virtual functions
virtual_functions.c++
Other components
- Program user
Connections 12
- Program user → Binary search: enters search values
binary_search.c - Program user → Circular linked list: chooses operations
circular_linked_list.c - Program user → Doubly linked list: chooses operations
double_linked_list.c - Program user → Circular queue: chooses operations
circular_queue.c - Program user → Priority queue: chooses operations
priority_queue.c - Program user → Heap sort: enters array
heap_sort.c - Program user → Merge sort: enters array
merge_sort.c - Program user → Trie: runs example
trie.c - Program user → Tree traversals: runs example
tree_traversals.c - Program user → Dijkstra shortest paths: runs example
dijkstra.c - Program user → Linked list: runs example
linked_list.c - AVL rotations → Tree traversals: related topic