A comprehensive implementation of common data structures in C++, built from scratch for self-learning purposes, including:
- Lists
- Array-based lists
- Linked lists
- Stacks
- Queues
- Hash tables
- Binary trees
- Heaps
- Graphs
- Written in modern C++ for better readability and performance.
- Includes detailed comments for learning and practice.
- Modular design for easy integration and extension.
- Two types of lists are currently implemented: linked lists and array-based lists.
- Supported methods include:
insert
remove
find
getSize
isEmpty
clear
- List elements can be accessed and modified using the operator
[]
.
This project is licensed under the MIT License - see the LICENSE file for details.