# ibtesam-hussain/recalling-dsa architecture

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

- Interactive diagram: https://gitdiagram.com/ibtesam-hussain/recalling-dsa
- Repository: https://github.com/ibtesam-hussain/recalling-dsa

## Overview

This repository is a collection of standalone C++ and Python examples for learning data structures and algorithms, not one integrated application. The usual workflow is to run an individual example, provide input when it prompts for it, and inspect its printed result. The graph groups examples by topic; it does not imply that they call one another. The source excerpts confirm some linked-list implementations and a linear-search interaction; relationships among the other examples are not shown.

Main entry points: [`Linked Lists/redundantFuncs/print_node.h`](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/redundantFuncs/print_node.h) (Singly list helpers), [`Arrays/LinearSearch.cpp`](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Arrays/LinearSearch.cpp) (Linear search), [`Linked Lists`](https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Linked%20Lists) (Singly linked lists), [`Linked Lists/CircularLL_Insertion.cpp`](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/CircularLL_Insertion.cpp) (Circular linked lists)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays_search["Arrays and Search"]
  node_array_operations["Array operations"]
  node_linear_search["Linear search<br/>[LinearSearch.cpp]"]
  node_binary_search_iter["Iterative binary search<br/>[binary-search.py]"]
  node_binary_search_opt["Optimized binary search"]
  node_binary_search_rec["Recursive binary search"]
end

subgraph group_linked_lists["Linked Lists"]
  node_singly_lists["Singly linked lists"]
  node_circular_lists["Circular linked lists"]
  node_doubly_lists["Doubly linked lists"]
  node_list_deletion["List deletion"]
  node_list_middle["Finding list middle"]
  node_list_reverse_sum["List reverse and sum"]
  node_singly_print["Singly list helpers<br/>[print_node.h]"]
  node_doubly_print["Doubly list helper"]
end

subgraph group_linear_structures["Stacks and Queues"]
  node_stack_examples["Stack examples"]
  node_queue_examples["Queue examples"]
end

subgraph group_trees_pointers["Trees and Pointers"]
  node_tree_examples["Tree examples"]
  node_pointer_examples["Pointer examples"]
end

subgraph group_recursion_misc["Recursion and Misc"]
  node_recursion_examples["Fibonacci examples<br/>[fibbonaci.py]"]
  node_palindrome_examples["Palindrome examples<br/>[validPalindrome.py]"]
  node_misc_examples["Other examples"]
end

node_user(("Example runner"))

node_user -->|"enters target"| node_linear_search
node_linear_search -->|"prints match"| node_user
node_singly_lists -->|"uses helper"| node_singly_print
node_circular_lists -->|"uses helper"| node_singly_print
node_list_deletion -->|"uses helper"| node_singly_print
node_list_middle -->|"uses helper"| node_singly_print
node_doubly_lists -->|"uses helper"| node_doubly_print

click node_array_operations "https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Arrays"
click node_linear_search "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Arrays/LinearSearch.cpp"
click node_binary_search_iter "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/binary-search.py"
click node_binary_search_opt "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/binary-search-optimize.py"
click node_binary_search_rec "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/binary-search-recursive.py"
click node_singly_lists "https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Linked%20Lists"
click node_circular_lists "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/CircularLL_Insertion.cpp"
click node_doubly_lists "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/doublyLL_Insert.cpp"
click node_list_deletion "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/deletion_SinglyLL.cpp"
click node_list_middle "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/middleNodeofLL_v2.cpp"
click node_list_reverse_sum "https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Linked%20Lists"
click node_singly_print "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/redundantFuncs/print_node.h"
click node_doubly_print "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/redundantFuncs/print_doubly_nodes.h"
click node_stack_examples "https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Stack"
click node_queue_examples "https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Queue"
click node_tree_examples "https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Trees"
click node_pointer_examples "https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Pointers"
click node_recursion_examples "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/fibbonaci.py"
click node_palindrome_examples "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/validPalindrome.py"
click node_misc_examples "https://github.com/ibtesam-hussain/recalling-dsa/blob/main/recalling_Cplusplus.cpp"

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_operations,node_linear_search,node_binary_search_iter,node_binary_search_opt,node_binary_search_rec toneBlue
class node_singly_lists,node_circular_lists,node_doubly_lists,node_list_deletion,node_list_middle,node_list_reverse_sum,node_singly_print,node_doubly_print toneAmber
class node_stack_examples,node_queue_examples toneMint
class node_tree_examples,node_pointer_examples toneRose
class node_recursion_examples,node_palindrome_examples,node_misc_examples,node_user toneIndigo
```

## Components

### Arrays and Search

- [Array operations](https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Arrays): `Arrays`
- [Linear search](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Arrays/LinearSearch.cpp): `Arrays/LinearSearch.cpp`
- [Iterative binary search](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/binary-search.py): `binary-search.py`
- [Optimized binary search](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/binary-search-optimize.py): `binary-search-optimize.py`
- [Recursive binary search](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/binary-search-recursive.py): `binary-search-recursive.py`

### Linked Lists

- [Singly linked lists](https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Linked%20Lists): `Linked Lists`
- [Circular linked lists](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/CircularLL_Insertion.cpp): `Linked Lists/CircularLL_Insertion.cpp`
- [Doubly linked lists](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/doublyLL_Insert.cpp): `Linked Lists/doublyLL_Insert.cpp`
- [List deletion](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/deletion_SinglyLL.cpp): `Linked Lists/deletion_SinglyLL.cpp`
- [Finding list middle](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/middleNodeofLL_v2.cpp): `Linked Lists/middleNodeofLL_v2.cpp`
- [List reverse and sum](https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Linked%20Lists): `Linked Lists`
- [Singly list helpers](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/redundantFuncs/print_node.h): `Linked Lists/redundantFuncs/print_node.h`
- [Doubly list helper](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/Linked%20Lists/redundantFuncs/print_doubly_nodes.h): `Linked Lists/redundantFuncs/print_doubly_nodes.h`

### Stacks and Queues

- [Stack examples](https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Stack): `Stack`
- [Queue examples](https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Queue): `Queue`

### Trees and Pointers

- [Tree examples](https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Trees): `Trees`
- [Pointer examples](https://github.com/ibtesam-hussain/recalling-dsa/tree/main/Pointers): `Pointers`

### Recursion and Misc

- [Fibonacci examples](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/fibbonaci.py): `fibbonaci.py`
- [Palindrome examples](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/validPalindrome.py): `validPalindrome.py`
- [Other examples](https://github.com/ibtesam-hussain/recalling-dsa/blob/main/recalling_Cplusplus.cpp): `recalling_Cplusplus.cpp`

### Other components

- **Example runner**

## Connections

- Example runner → Linear search: enters target (evidence: `Arrays/LinearSearch.cpp`)
- Linear search → Example runner: prints match (evidence: `Arrays/LinearSearch.cpp`)
- Singly linked lists → Singly list helpers: uses helper (evidence: `Linked Lists/SinglyLL_AllinOneInsertion.cpp`)
- Circular linked lists → Singly list helpers: uses helper (evidence: `Linked Lists/CircularLL_Insertion.cpp`)
- List deletion → Singly list helpers: uses helper (evidence: `Linked Lists/deletion_SinglyLL.cpp`)
- Finding list middle → Singly list helpers: uses helper (evidence: `Linked Lists/middleNodeofLL_v2.cpp`)
- Doubly linked lists → Doubly list helper: uses helper (evidence: `Linked Lists/doublyLL_Insert.cpp`)
