# aqtanbi/daa_assignment_2 architecture

> Architecture diagram of the GitHub repository aqtanbi/daa_assignment_2, 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/aqtanbi/daa_assignment_2
- Repository: https://github.com/aqtanbi/daa_assignment_2

## Overview

This is a Java algorithms assignment implementing three standalone integer data structures: a resizable array, a singly linked list, and an array-backed min-heap. Their public operations let a caller add, access, remove, or inspect values; the heap also supports minimum extraction. Each implementation manages its own representation and invariants, with no shared runtime orchestrator or external service. The README documents the capabilities; the supplied excerpts show their implementations. Benchmark and test code are not part of the runtime architecture.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_array["Dynamic Array"]
  node_dynamic_array["Resizable Storage<br/>[DynamicArray.java]"]
end

subgraph group_list["Linked List"]
  node_linked_list["Singly Linked Nodes<br/>[LinkedList.java]"]
end

subgraph group_heap["Min Heap"]
  node_min_heap["Priority Operations<br/>[MinHeap.java]"]
end

node_caller(("Library Caller"))

click node_dynamic_array "https://github.com/aqtanbi/daa_assignment_2/blob/main/src/main/java/DynamicArray.java"
click node_linked_list "https://github.com/aqtanbi/daa_assignment_2/blob/main/src/main/java/LinkedList.java"
click node_min_heap "https://github.com/aqtanbi/daa_assignment_2/blob/main/src/main/java/MinHeap.java"

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_dynamic_array toneBlue
class node_linked_list toneAmber
class node_min_heap toneMint
class node_caller toneIndigo
```

## Components

### Dynamic Array

- [Resizable Storage](https://github.com/aqtanbi/daa_assignment_2/blob/main/src/main/java/DynamicArray.java): `src/main/java/DynamicArray.java`

### Linked List

- [Singly Linked Nodes](https://github.com/aqtanbi/daa_assignment_2/blob/main/src/main/java/LinkedList.java): `src/main/java/LinkedList.java`

### Min Heap

- [Priority Operations](https://github.com/aqtanbi/daa_assignment_2/blob/main/src/main/java/MinHeap.java): `src/main/java/MinHeap.java`

### Other components

- **Library Caller**
