This repository is contained to implementing and exploring various fundamental data structures in C++. The goal is to provide well-documented, efficient, and easy-to-understand implementations for educational and practical purposes.
- Suffix Tree
- Insertion, and Search operation for substrings
- Using SingleLinkedList as a base
- Dynamic Interval Tree
- Insertion, and search operations
- Using Binary Search tree as a base
- Each data structure is contained in a separate folder.
- Each folder contains a
README.md
file that describes the data structure, its constraints, and its test cases. - There is a
Main.cpp
file in each folder that includes the test cases for the data structure.
- Clone the repository.
git clone https://github.com/AbdelrhmanReda17/Advanced-Data-Structures/
- Navigate to the directory.
cd Advanced-Data-Structures
- Open the project in CLION IDE or text editor.
- Compile and run the project.
g++ Main.cpp -o Main ./Main
- You can modify the test cases in
Main.cpp
according to your needs.
- This project is maintained by: Abdelrhman Reda, Mahmoud Adel, Abdelrhman Atef, AbdelrhmanAdel and Yassin Tareek
- Feel free to contribute, report issues, or provide feedback