# soumodip-saha/c-codes architecture

> Architecture diagram of the GitHub repository soumodip-saha/c-codes, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-11-21). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/soumodip-saha/c-codes
- Repository: https://github.com/soumodip-saha/c-codes

## Overview

This repository is a collection of standalone C examples for common data structures, searches, and recursion—not a single integrated application. The typical workflow is a user choosing operations in a program’s console menu or entering values, then viewing the result printed by that program. The examples cover linked lists, queues and stacks, trees, and searching; several are separate implementations of the same concept. Edges are limited to console interactions visible in sampled source; other programs are represented without inferred runtime links.

Main entry points: [`Singly Linked List.c`](https://github.com/soumodip-saha/c-codes/blob/main/Singly%20Linked%20List.c) (Singly List), [`Doubly Linked List.c`](https://github.com/soumodip-saha/c-codes/blob/main/Doubly%20Linked%20List.c) (Doubly List), [`Circular Linked List.c`](https://github.com/soumodip-saha/c-codes/blob/main/Circular%20Linked%20List.c) (Circular List), [`BST.c`](https://github.com/soumodip-saha/c-codes/blob/main/BST.c) (BST Operations)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_lists["Linked Lists"]
  node_singly["Singly List"]
  node_doubly["Doubly List"]
  node_circular["Circular List"]
end

subgraph group_queues["Queues And Stacks"]
  node_linearq["Linear Queue<br/>[Linear Queue.c]"]
  node_linearqll["Linked Queue"]
  node_circularq["Circular Queue<br/>[Circular Queue.c]"]
  node_circularqll["Linked Circular Queue"]
  node_deque["Array Deque"]
  node_dequell["Linked Deque"]
  node_stackarray["Array Stack"]
  node_stackll["Linked Stack"]
end

subgraph group_trees["Trees And Recursion"]
  node_bst["BST Operations<br/>[BST.c]"]
  node_bstcreate["BST Creation<br/>[BST_CREATE.c]"]
  node_tree["Tree Traversals<br/>[Tree.c]"]
  node_treenumbers["Number Tree<br/>[Tree&#40;numbers&#41;.c]"]
  node_factorial["Tail Factorial"]
  node_hanoi["Tower Of Hanoi<br/>[Tower of Hanoi.c]"]
end

subgraph group_search["Searching"]
  node_linearsearch["Array Linear Search<br/>[Linear Search.c]"]
  node_linearsearchll["List Linear Search"]
  node_binarysearch["Array Binary Search<br/>[Binary_Search.c]"]
  node_binarysearchll["List Binary Search"]
end

node_user(("Console User"))

node_user -->|"chooses operations"| node_singly
node_user -->|"chooses operations"| node_doubly
node_user -->|"chooses operations"| node_circular
node_singly -->|"prints results"| node_user
node_doubly -->|"prints results"| node_user
node_circular -->|"prints results"| node_user
node_user -->|"enters values"| node_binarysearch
node_binarysearch -->|"prints result"| node_user
node_user -->|"enters values"| node_binarysearchll
node_binarysearchll -->|"prints result"| node_user
node_user -->|"enters values"| node_linearsearch
node_linearsearch -->|"prints result"| node_user
node_user -->|"enters values"| node_linearsearchll
node_linearsearchll -->|"prints result"| node_user
node_user -->|"chooses operations"| node_bst
node_bst -->|"prints results"| node_user
node_user -->|"chooses operations"| node_bstcreate
node_bstcreate -->|"prints results"| node_user
node_user -->|"chooses traversal"| node_tree
node_tree -->|"prints traversal"| node_user

click node_singly "https://github.com/soumodip-saha/c-codes/blob/main/Singly%20Linked%20List.c"
click node_doubly "https://github.com/soumodip-saha/c-codes/blob/main/Doubly%20Linked%20List.c"
click node_circular "https://github.com/soumodip-saha/c-codes/blob/main/Circular%20Linked%20List.c"
click node_linearq "https://github.com/soumodip-saha/c-codes/blob/main/Linear%20Queue.c"
click node_linearqll "https://github.com/soumodip-saha/c-codes/blob/main/Linear%20Queue%20using%20Linked%20List.c"
click node_circularq "https://github.com/soumodip-saha/c-codes/blob/main/Circular%20Queue.c"
click node_circularqll "https://github.com/soumodip-saha/c-codes/blob/main/Circular%20Queue%20using%20Linked%20List.c"
click node_deque "https://github.com/soumodip-saha/c-codes/blob/main/Double%20Ended%20Queue.c"
click node_dequell "https://github.com/soumodip-saha/c-codes/blob/main/Double%20Ended%20Queue%20using%20Linked%20List.c"
click node_stackarray "https://github.com/soumodip-saha/c-codes/blob/main/Stack%20using%20Array.c"
click node_stackll "https://github.com/soumodip-saha/c-codes/blob/main/Stack%20using%20Linked%20List.c"
click node_bst "https://github.com/soumodip-saha/c-codes/blob/main/BST.c"
click node_bstcreate "https://github.com/soumodip-saha/c-codes/blob/main/BST_CREATE.c"
click node_tree "https://github.com/soumodip-saha/c-codes/blob/main/Tree.c"
click node_treenumbers "https://github.com/soumodip-saha/c-codes/blob/main/Tree(numbers).c"
click node_factorial "https://github.com/soumodip-saha/c-codes/blob/main/Factorial%20Tail%20Recursion.c"
click node_hanoi "https://github.com/soumodip-saha/c-codes/blob/main/Tower%20of%20Hanoi.c"
click node_linearsearch "https://github.com/soumodip-saha/c-codes/blob/main/Linear%20Search.c"
click node_linearsearchll "https://github.com/soumodip-saha/c-codes/blob/main/Linear%20Search%20on%20Linked%20List.c"
click node_binarysearch "https://github.com/soumodip-saha/c-codes/blob/main/Binary_Search.c"
click node_binarysearchll "https://github.com/soumodip-saha/c-codes/blob/main/Binary_Search%20on%20Linked%20List.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_singly,node_doubly,node_circular,node_user toneBlue
class node_linearq,node_linearqll,node_circularq,node_circularqll,node_deque,node_dequell,node_stackarray,node_stackll toneAmber
class node_bst,node_bstcreate,node_tree,node_treenumbers,node_factorial,node_hanoi toneMint
class node_linearsearch,node_linearsearchll,node_binarysearch,node_binarysearchll toneRose
```

## Components

### Linked Lists

- [Singly List](https://github.com/soumodip-saha/c-codes/blob/main/Singly%20Linked%20List.c): `Singly Linked List.c`
- [Doubly List](https://github.com/soumodip-saha/c-codes/blob/main/Doubly%20Linked%20List.c): `Doubly Linked List.c`
- [Circular List](https://github.com/soumodip-saha/c-codes/blob/main/Circular%20Linked%20List.c): `Circular Linked List.c`

### Queues And Stacks

- [Linear Queue](https://github.com/soumodip-saha/c-codes/blob/main/Linear%20Queue.c): `Linear Queue.c`
- [Linked Queue](https://github.com/soumodip-saha/c-codes/blob/main/Linear%20Queue%20using%20Linked%20List.c): `Linear Queue using Linked List.c`
- [Circular Queue](https://github.com/soumodip-saha/c-codes/blob/main/Circular%20Queue.c): `Circular Queue.c`
- [Linked Circular Queue](https://github.com/soumodip-saha/c-codes/blob/main/Circular%20Queue%20using%20Linked%20List.c): `Circular Queue using Linked List.c`
- [Array Deque](https://github.com/soumodip-saha/c-codes/blob/main/Double%20Ended%20Queue.c): `Double Ended Queue.c`
- [Linked Deque](https://github.com/soumodip-saha/c-codes/blob/main/Double%20Ended%20Queue%20using%20Linked%20List.c): `Double Ended Queue using Linked List.c`
- [Array Stack](https://github.com/soumodip-saha/c-codes/blob/main/Stack%20using%20Array.c): `Stack using Array.c`
- [Linked Stack](https://github.com/soumodip-saha/c-codes/blob/main/Stack%20using%20Linked%20List.c): `Stack using Linked List.c`

### Trees And Recursion

- [BST Operations](https://github.com/soumodip-saha/c-codes/blob/main/BST.c): `BST.c`
- [BST Creation](https://github.com/soumodip-saha/c-codes/blob/main/BST_CREATE.c): `BST_CREATE.c`
- [Tree Traversals](https://github.com/soumodip-saha/c-codes/blob/main/Tree.c): `Tree.c`
- [Number Tree](https://github.com/soumodip-saha/c-codes/blob/main/Tree(numbers).c): `Tree(numbers).c`
- [Tail Factorial](https://github.com/soumodip-saha/c-codes/blob/main/Factorial%20Tail%20Recursion.c): `Factorial Tail Recursion.c`
- [Tower Of Hanoi](https://github.com/soumodip-saha/c-codes/blob/main/Tower%20of%20Hanoi.c): `Tower of Hanoi.c`

### Searching

- [Array Linear Search](https://github.com/soumodip-saha/c-codes/blob/main/Linear%20Search.c): `Linear Search.c`
- [List Linear Search](https://github.com/soumodip-saha/c-codes/blob/main/Linear%20Search%20on%20Linked%20List.c): `Linear Search on Linked List.c`
- [Array Binary Search](https://github.com/soumodip-saha/c-codes/blob/main/Binary_Search.c): `Binary_Search.c`
- [List Binary Search](https://github.com/soumodip-saha/c-codes/blob/main/Binary_Search%20on%20Linked%20List.c): `Binary_Search on Linked List.c`

### Other components

- **Console User**

## Connections

- Console User → Singly List: chooses operations (evidence: `Singly Linked List.c`)
- Console User → Doubly List: chooses operations (evidence: `Doubly Linked List.c`)
- Console User → Circular List: chooses operations (evidence: `Circular Linked List.c`)
- Singly List → Console User: prints results (evidence: `Singly Linked List.c`)
- Doubly List → Console User: prints results (evidence: `Doubly Linked List.c`)
- Circular List → Console User: prints results (evidence: `Circular Linked List.c`)
- Console User → Array Binary Search: enters values (evidence: `Binary_Search.c`)
- Array Binary Search → Console User: prints result (evidence: `Binary_Search.c`)
- Console User → List Binary Search: enters values (evidence: `Binary_Search on Linked List.c`)
- List Binary Search → Console User: prints result (evidence: `Binary_Search on Linked List.c`)
- Console User → Array Linear Search: enters values (evidence: `Linear Search.c`)
- Array Linear Search → Console User: prints result (evidence: `Linear Search.c`)
- Console User → List Linear Search: enters values (evidence: `Linear Search on Linked List.c`)
- List Linear Search → Console User: prints result (evidence: `Linear Search on Linked List.c`)
- Console User → BST Operations: chooses operations (evidence: `BST.c`)
- BST Operations → Console User: prints results (evidence: `BST.c`)
- Console User → BST Creation: chooses operations (evidence: `BST_CREATE.c`)
- BST Creation → Console User: prints results (evidence: `BST_CREATE.c`)
- Console User → Tree Traversals: chooses traversal (evidence: `Tree.c`)
- Tree Traversals → Console User: prints traversal (evidence: `Tree.c`)
