This repository showcases implementations of various fundamental data structures and algorithms. Each project demonstrates a different approach, offering practical applications and performance optimizations.
- Project 1: Singly Linked List – Basic implementation with node insertion, deletion, and other.
- Project 2: Doubly Linked List – Advanced list supporting forward and backward traversal with various operations.
- Project 3: Queue using Doubly Linked List – Queue data structure with FIFO operations leveraging a doubly linked list.
- Project 4: Stack using Queue – Stack (LIFO) behavior implemented using a queue data structure.
- Project 5: Dynamic Array – A custom dynamic array with automatic resizing and efficient data manipulation.
- Project 6: Queue using Dynamic Array – Queue (FIFO) data structure implemented using a dynamic array.
- Project 7: Stack using Queue (MyDynamicArray) – Stack (LIFO) implemented using a queue based on a dynamic array.
- Project 8: UndoRedoManager – A generic class for managing undo and redo operations in an application.
- Optimized performance for data access and manipulation.
- Flexible implementations suitable for various use cases.
- Educational value: Demonstrates how to build and apply data structures in real-world scenarios.
Clone the repository to explore individual projects:
https://github.com/Zyad-Eltayabi/Data-Structures-Small-Projects.gitEach project is self-contained with its own implementation and instructions.