A C++ implementation of an Undo/Redo system using custom-built data structures.
This project demonstrates how Undo and Redo operations work internally by using multiple data structures implemented from scratch without relying on STL containers.
The system stores and restores previous states, allowing users to move backward and forward through changes, similar to modern text editors and productivity applications.
- Doubly Linked List
- Dynamic Array
- Stack
- Queue
- Custom String Class
- Store multiple states
- Undo previous changes
- Redo reverted changes
- Custom implementation of core data structures
- No STL containers used for the main logic
- Linked Lists
- Dynamic Memory Allocation
- Stack Operations
- Queue Operations
- State Management
- Undo/Redo Algorithms
- Open the solution in Visual Studio.
- Build the project.
- Run the application.
Omar Mohamed Abdul-Khalek