ProgrammingAdvices.com · Course 12 of the Roadmap · By Dr. Mohammed Abu-Hadhoud
This repository contains my solutions and implementations for Course 12 — Data Structures Level 1 from ProgrammingAdvices.com, taught by Dr. Mohammed Abu-Hadhoud.
Course 12 introduces core data structures — taught clearly, correctly, and at exactly the right point in the learning roadmap after mastering OOP. The course focuses on understanding how data structures work under the hood by implementing them from scratch in C++.
Implementations of fundamental data structures built from scratch using C++ and OOP:
- Singly Linked List — insert at beginning, end, after node; find; delete; reverse
- Node-based memory management with pointer manipulation
| Topic | Description |
|---|---|
| Linked Lists | Dynamic node-based linear data structure |
| Pointers & Memory | Manual allocation with new and pointer chaining |
| Node Design | Encapsulating data and next pointer in a Node class |
| Traversal | Forward and reverse traversal of linked nodes |
| Insertion | At beginning, end, after a specific node |
| Deletion | Remove by value or position |
| Search | Find node by value |
- Language: C++
- Paradigm: Object-Oriented Programming (OOP)
- IDE: Visual Studio
- Manual memory management with pointers
- Building data structures from scratch (no STL shortcuts)
- Understanding time and space complexity
- Designing clean, reusable class interfaces
- Applying OOP principles to data structure design
This course is Step 12 in the ProgrammingAdvices Roadmap.
... → Course 11 (OOP Applications) → Course 12 (Data Structures L1) ✅ → Course 13 (Algorithms L5) → ...
- 🌐 Course Page
- 👨🏫 Instructor: Dr. Mohammed Abu-Hadhoud
- 🏫 Platform: ProgrammingAdvices.com
Made with ❤️ by Ahmad Mallad