# balaji-aiml/data-structure-c architecture

> Architecture diagram of the GitHub repository balaji-aiml/data-structure-c, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-03). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/balaji-aiml/data-structure-c
- Repository: https://github.com/balaji-aiml/data-structure-c

## Overview

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`](https://github.com/balaji-aiml/data-structure-c/blob/main/tree_traversals.c) (Tree traversals), [`avl_tree_rotations.c`](https://github.com/balaji-aiml/data-structure-c/blob/main/avl_tree_rotations.c) (AVL rotations), [`heap_sort.c`](https://github.com/balaji-aiml/data-structure-c/blob/main/heap_sort.c) (Heap sort), [`merge_sort.c`](https://github.com/balaji-aiml/data-structure-c/blob/main/merge_sort.c) (Merge sort)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_sorting["Sorting"]
  node_heap_sort["Heap sort<br/>[heap_sort.c]"]
  node_merge_sort["Merge sort<br/>[merge_sort.c]"]
  node_quick_sort["Quick sort<br/>[quick_sort.c]"]
end

subgraph group_structures["Data Structures"]
  node_linked_list["Linked list<br/>[linked_list.c]"]
  node_circular_list["Circular linked list"]
  node_double_list["Doubly linked list"]
  node_circular_queue["Circular queue<br/>[circular_queue.c]"]
  node_priority_queue["Priority queue<br/>[priority_queue.c]"]
  node_hashing["Hashing<br/>[hashing.c]"]
  node_trie["Trie<br/>[trie.c]"]
  node_expression_stack["Expression stack<br/>[exp_evl_stack.c]"]
end

subgraph group_trees_graphs["Trees and Graphs"]
  node_avl["AVL rotations"]
  node_tree_traversals["Tree traversals<br/>[tree_traversals.c]"]
  node_dijkstra["Dijkstra shortest paths<br/>[dijkstra.c]"]
end

subgraph group_other["Other Algorithms"]
  node_binary_search["Binary search<br/>[binary_search.c]"]
  node_dp["Dynamic programming<br/>[dp.c]"]
  node_fcfs["FCFS scheduling<br/>[fcfs.c]"]
  node_string_stack["Stack string reversal"]
  node_string_traversals["String traversals"]
  node_virtual_functions["Virtual functions"]
end

node_user(("Program user"))

node_user -->|"enters search values"| node_binary_search
node_user -->|"chooses operations"| node_circular_list
node_user -->|"chooses operations"| node_double_list
node_user -->|"chooses operations"| node_circular_queue
node_user -->|"chooses operations"| node_priority_queue
node_user -->|"enters array"| node_heap_sort
node_user -->|"enters array"| node_merge_sort
node_user -->|"runs example"| node_trie
node_user -->|"runs example"| node_tree_traversals
node_user -->|"runs example"| node_dijkstra
node_user -->|"runs example"| node_linked_list
node_avl -.->|"related topic"| node_tree_traversals

click node_heap_sort "https://github.com/balaji-aiml/data-structure-c/blob/main/heap_sort.c"
click node_merge_sort "https://github.com/balaji-aiml/data-structure-c/blob/main/merge_sort.c"
click node_quick_sort "https://github.com/balaji-aiml/data-structure-c/blob/main/quick_sort.c"
click node_binary_search "https://github.com/balaji-aiml/data-structure-c/blob/main/binary_search.c"
click node_linked_list "https://github.com/balaji-aiml/data-structure-c/blob/main/linked_list.c"
click node_circular_list "https://github.com/balaji-aiml/data-structure-c/blob/main/circular_linked_list.c"
click node_double_list "https://github.com/balaji-aiml/data-structure-c/blob/main/double_linked_list.c"
click node_circular_queue "https://github.com/balaji-aiml/data-structure-c/blob/main/circular_queue.c"
click node_priority_queue "https://github.com/balaji-aiml/data-structure-c/blob/main/priority_queue.c"
click node_hashing "https://github.com/balaji-aiml/data-structure-c/blob/main/hashing.c"
click node_trie "https://github.com/balaji-aiml/data-structure-c/blob/main/trie.c"
click node_avl "https://github.com/balaji-aiml/data-structure-c/blob/main/avl_tree_rotations.c"
click node_tree_traversals "https://github.com/balaji-aiml/data-structure-c/blob/main/tree_traversals.c"
click node_dijkstra "https://github.com/balaji-aiml/data-structure-c/blob/main/dijkstra.c"
click node_dp "https://github.com/balaji-aiml/data-structure-c/blob/main/dp.c"
click node_expression_stack "https://github.com/balaji-aiml/data-structure-c/blob/main/exp_evl_stack.c"
click node_fcfs "https://github.com/balaji-aiml/data-structure-c/blob/main/fcfs.c"
click node_string_stack "https://github.com/balaji-aiml/data-structure-c/blob/main/string_reverse_using_stack.c"
click node_string_traversals "https://github.com/balaji-aiml/data-structure-c/blob/main/string_traversals.c%2B%2B"
click node_virtual_functions "https://github.com/balaji-aiml/data-structure-c/blob/main/virtual_functions.c%2B%2B"

classDef toneNeutral fill:#f8fafc,stroke:#334155,stroke-width:1.5px,color:#0f172a
classDef toneBlue fill:#dbeafe,stroke:#2563eb,stroke-width:1.5px,color:#172554
classDef toneAmber fill:#fef3c7,stroke:#d97706,stroke-width:1.5px,color:#78350f
classDef toneMint fill:#dcfce7,stroke:#16a34a,stroke-width:1.5px,color:#14532d
classDef toneRose fill:#ffe4e6,stroke:#e11d48,stroke-width:1.5px,color:#881337
classDef toneIndigo fill:#e0e7ff,stroke:#4f46e5,stroke-width:1.5px,color:#312e81
classDef toneTeal fill:#ccfbf1,stroke:#0f766e,stroke-width:1.5px,color:#134e4a
class node_heap_sort,node_merge_sort,node_quick_sort,node_user toneBlue
class node_linked_list,node_circular_list,node_double_list,node_circular_queue,node_priority_queue,node_hashing,node_trie,node_expression_stack toneAmber
class node_avl,node_tree_traversals,node_dijkstra toneMint
class node_binary_search,node_dp,node_fcfs,node_string_stack,node_string_traversals,node_virtual_functions toneRose
```

## Components

### Sorting

- [Heap sort](https://github.com/balaji-aiml/data-structure-c/blob/main/heap_sort.c): `heap_sort.c`
- [Merge sort](https://github.com/balaji-aiml/data-structure-c/blob/main/merge_sort.c): `merge_sort.c`
- [Quick sort](https://github.com/balaji-aiml/data-structure-c/blob/main/quick_sort.c): `quick_sort.c`

### Data Structures

- [Linked list](https://github.com/balaji-aiml/data-structure-c/blob/main/linked_list.c): `linked_list.c`
- [Circular linked list](https://github.com/balaji-aiml/data-structure-c/blob/main/circular_linked_list.c): `circular_linked_list.c`
- [Doubly linked list](https://github.com/balaji-aiml/data-structure-c/blob/main/double_linked_list.c): `double_linked_list.c`
- [Circular queue](https://github.com/balaji-aiml/data-structure-c/blob/main/circular_queue.c): `circular_queue.c`
- [Priority queue](https://github.com/balaji-aiml/data-structure-c/blob/main/priority_queue.c): `priority_queue.c`
- [Hashing](https://github.com/balaji-aiml/data-structure-c/blob/main/hashing.c): `hashing.c`
- [Trie](https://github.com/balaji-aiml/data-structure-c/blob/main/trie.c): `trie.c`
- [Expression stack](https://github.com/balaji-aiml/data-structure-c/blob/main/exp_evl_stack.c): `exp_evl_stack.c`

### Trees and Graphs

- [AVL rotations](https://github.com/balaji-aiml/data-structure-c/blob/main/avl_tree_rotations.c): `avl_tree_rotations.c`
- [Tree traversals](https://github.com/balaji-aiml/data-structure-c/blob/main/tree_traversals.c): `tree_traversals.c`
- [Dijkstra shortest paths](https://github.com/balaji-aiml/data-structure-c/blob/main/dijkstra.c): `dijkstra.c`

### Other Algorithms

- [Binary search](https://github.com/balaji-aiml/data-structure-c/blob/main/binary_search.c): `binary_search.c`
- [Dynamic programming](https://github.com/balaji-aiml/data-structure-c/blob/main/dp.c): `dp.c`
- [FCFS scheduling](https://github.com/balaji-aiml/data-structure-c/blob/main/fcfs.c): `fcfs.c`
- [Stack string reversal](https://github.com/balaji-aiml/data-structure-c/blob/main/string_reverse_using_stack.c): `string_reverse_using_stack.c`
- [String traversals](https://github.com/balaji-aiml/data-structure-c/blob/main/string_traversals.c%2B%2B): `string_traversals.c++`
- [Virtual functions](https://github.com/balaji-aiml/data-structure-c/blob/main/virtual_functions.c%2B%2B): `virtual_functions.c++`

### Other components

- **Program user**

## Connections

- Program user → Binary search: enters search values (evidence: `binary_search.c`)
- Program user → Circular linked list: chooses operations (evidence: `circular_linked_list.c`)
- Program user → Doubly linked list: chooses operations (evidence: `double_linked_list.c`)
- Program user → Circular queue: chooses operations (evidence: `circular_queue.c`)
- Program user → Priority queue: chooses operations (evidence: `priority_queue.c`)
- Program user → Heap sort: enters array (evidence: `heap_sort.c`)
- Program user → Merge sort: enters array (evidence: `merge_sort.c`)
- Program user → Trie: runs example (evidence: `trie.c`)
- Program user → Tree traversals: runs example (evidence: `tree_traversals.c`)
- Program user → Dijkstra shortest paths: runs example (evidence: `dijkstra.c`)
- Program user → Linked list: runs example (evidence: `linked_list.c`)
- AVL rotations → Tree traversals: related topic
