https://github.com/spo0kydev/datastructures-cpp
Data Structures in C++
https://github.com/spo0kydev/datastructures-cpp
academic algortithms c-plus-plus computer-science cpp data-structures datastructures learning no-stl self-study
Last synced: 11 months ago
JSON representation
Data Structures in C++
- Host: GitHub
- URL: https://github.com/spo0kydev/datastructures-cpp
- Owner: Spo0kyDev
- License: mit
- Created: 2025-04-18T02:44:33.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2025-04-18T05:41:53.000Z (12 months ago)
- Last Synced: 2025-04-18T16:51:01.760Z (12 months ago)
- Topics: academic, algortithms, c-plus-plus, computer-science, cpp, data-structures, datastructures, learning, no-stl, self-study
- Homepage: https://spo0ky.dev
- Size: 3.91 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
A personal archive of fundamental data structures — built from scratch in C++, for clarity, control, and understanding.
---
# 🧬 Data Structures in C++
This repository is a look into the structures beneath the surface — lists, trees, maps, and memory.
It's not meant to be flashy. It's a place to work through ideas, document the logic, and leave behind a clear trail.
Everything here is built from scratch in C++, piece by piece — as both study and statement.
---
## 🎯 Project Goals
This repo is about clarity — understanding how data is stored, accessed, and shaped in memory.
- Practice writing clean, self-contained C++ code
- Reinforce computer science foundations (with testable proof)
- Build a long-term reference that I control and understand
- Leave behind something others can trace, if they choose to follow
---
## 📦 Structures To Be Implemented
These are the structures I’ve chosen to build from the ground up — not to check a box, but to understand their mechanics without abstraction.
There’s a difference between knowing something works and knowing *why*.
### 🔹 Core Foundations
- [ ] Array Operations
- [ ] Recursion (Call Stack Visualization)
- [ ] Algorithm Analysis (Big-O / Complexity Notes)
### 🔹 Linear Structures
- [ ] Array-Based Stack
- [ ] Array-Based Queue
- [ ] Postfix Notation / Balanced Parentheses Parser
- [ ] Linked List (Singly)
- [ ] Doubly Linked List
### 🔹 Priority & Sorting
- [ ] Array-Based Priority Queue
- [ ] Quicksort
- [ ] Heapsort
- [ ] Min Heap / Max Heap
### 🔹 Hashing
- [ ] Hash Table (with Linear/Quadratic Probing)
- [ ] Hash Function Analysis
### 🔹 Trees & Beyond
- [ ] Binary Search Tree (BST)
- [ ] Tree Traversals (Inorder, Preorder, Postorder)
- [ ] AVL Tree (if time allows)
- [ ] Graph (Adjacency List)
> These structures are implemented not just to function, but to be understood. No STL containers, no libraries — only raw C++ and memory.
---
## 🛠️ Code Style & Documentation
This codebase follows a simple rule: write for the person who comes after — even if that person is just you, six months from now.
- Doxygen-style comments will be used throughout all source files
- Code is written with clarity in mind — minimal abstraction, maximum readability
- Variable and function names are chosen with intention — the code should tell the story without needing a decoder
Self-documenting code is the goal. Comments exist not to explain *what* the code is doing, but *why* it’s doing it.
> I don’t write code to impress the compiler — I write it so I can read it later and know I wasn’t lying to myself.
> I’m not here to obfuscate. I’m here to observe, implement, and understand.
---
// End of Line — observed but not yet fully explained