# helixgen/datastructures architecture

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

- Interactive diagram: https://gitdiagram.com/helixgen/datastructures
- Repository: https://github.com/helixgen/datastructures

## Overview

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.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays_text["Arrays and text"]
  node_array["Array operations<br/>[Array.c]"]
  node_strings["String algorithms<br/>[Strings.c]"]
end

subgraph group_lists["Linked lists"]
  node_linked_list["Linked list<br/>[LinkedList.c]"]
  node_doubly_list["Doubly linked list<br/>[DoublyLinkedList.c]"]
  node_circular_list["Circular linked list"]
end

subgraph group_queues_stacks["Queues and stacks"]
  node_queue["Queue<br/>[Queues.c]"]
  node_circular_queue["Circular queue<br/>[CircularQueue.c]"]
  node_dequeue["Double-ended queue<br/>[Dequeue.c]"]
  node_stack["Stack variants<br/>[Stack.c]"]
  node_stack_brackets["Bracket validation<br/>[Stack2.c]"]
  node_stack_expressions["Expression evaluation<br/>[Stack3.c]"]
end

subgraph group_trees_matrices["Trees and matrices"]
  node_binary_search_tree["Binary search tree"]
  node_tree_traversals["Tree traversals<br/>[Trees.c]"]
  node_matrices["Special matrices<br/>[Matrices.c]"]
  node_recursion["Recursion examples<br/>[Recursion.c]"]
end

click node_array "https://github.com/helixgen/datastructures/blob/main/Array.c"
click node_strings "https://github.com/helixgen/datastructures/blob/main/Strings.c"
click node_linked_list "https://github.com/helixgen/datastructures/blob/main/LinkedList.c"
click node_doubly_list "https://github.com/helixgen/datastructures/blob/main/DoublyLinkedList.c"
click node_circular_list "https://github.com/helixgen/datastructures/blob/main/CircularLinkedList.c"
click node_queue "https://github.com/helixgen/datastructures/blob/main/Queues.c"
click node_circular_queue "https://github.com/helixgen/datastructures/blob/main/CircularQueue.c"
click node_dequeue "https://github.com/helixgen/datastructures/blob/main/Dequeue.c"
click node_stack "https://github.com/helixgen/datastructures/blob/main/Stack.c"
click node_stack_brackets "https://github.com/helixgen/datastructures/blob/main/Stack2.c"
click node_stack_expressions "https://github.com/helixgen/datastructures/blob/main/Stack3.c"
click node_binary_search_tree "https://github.com/helixgen/datastructures/blob/main/BinarySearchTrees.c"
click node_tree_traversals "https://github.com/helixgen/datastructures/blob/main/Trees.c"
click node_matrices "https://github.com/helixgen/datastructures/blob/main/Matrices.c"
click node_recursion "https://github.com/helixgen/datastructures/blob/main/Recursion.c"

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_array,node_strings toneBlue
class node_linked_list,node_doubly_list,node_circular_list toneAmber
class node_queue,node_circular_queue,node_dequeue,node_stack,node_stack_brackets,node_stack_expressions toneMint
class node_binary_search_tree,node_tree_traversals,node_matrices,node_recursion toneRose
```

## Components

### Arrays and text

- [Array operations](https://github.com/helixgen/datastructures/blob/main/Array.c): `Array.c`
- [String algorithms](https://github.com/helixgen/datastructures/blob/main/Strings.c): `Strings.c`

### Linked lists

- [Linked list](https://github.com/helixgen/datastructures/blob/main/LinkedList.c): `LinkedList.c`
- [Doubly linked list](https://github.com/helixgen/datastructures/blob/main/DoublyLinkedList.c): `DoublyLinkedList.c`
- [Circular linked list](https://github.com/helixgen/datastructures/blob/main/CircularLinkedList.c): `CircularLinkedList.c`

### Queues and stacks

- [Queue](https://github.com/helixgen/datastructures/blob/main/Queues.c): `Queues.c`
- [Circular queue](https://github.com/helixgen/datastructures/blob/main/CircularQueue.c): `CircularQueue.c`
- [Double-ended queue](https://github.com/helixgen/datastructures/blob/main/Dequeue.c): `Dequeue.c`
- [Stack variants](https://github.com/helixgen/datastructures/blob/main/Stack.c): `Stack.c`
- [Bracket validation](https://github.com/helixgen/datastructures/blob/main/Stack2.c): `Stack2.c`
- [Expression evaluation](https://github.com/helixgen/datastructures/blob/main/Stack3.c): `Stack3.c`

### Trees and matrices

- [Binary search tree](https://github.com/helixgen/datastructures/blob/main/BinarySearchTrees.c): `BinarySearchTrees.c`
- [Tree traversals](https://github.com/helixgen/datastructures/blob/main/Trees.c): `Trees.c`
- [Special matrices](https://github.com/helixgen/datastructures/blob/main/Matrices.c): `Matrices.c`
- [Recursion examples](https://github.com/helixgen/datastructures/blob/main/Recursion.c): `Recursion.c`
