In this project, we explore and compare the efficiency of different data structures for search operations, insertion, and deletion in dynamic sets. We have implemented four distinct data structures and evaluated their performance in various scenarios.
An AVL tree is a self-balancing binary search tree where the difference between heights of left and right subtrees cannot be more than one for all nodes. The AVL tree ensures O(log n) time complexity for search, insertion, and deletion operations.
A Splay Tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. This tree performs splaying, bringing the accessed node to the root, and can achieve O(log n) amortized time complexity.
This hash table resolves collisions using chaining, where each bucket is a linked list. If multiple elements hash to the same bucket, they are added to the list at that bucket. This implementation includes dynamic resizing of the table to maintain efficiency.
In this hash table, collisions are resolved using linear probing. When a collision occurs, the algorithm probes linearly through the array to find the next empty slot. This implementation also supports dynamic resizing to ensure optimal performance.
- AVL Tree: Maintains balance through rotations, ensuring efficient operations.
- Splay Tree: Self-adjusting to frequently accessed elements.
- Hash Table with Chaining: Efficient handling of collisions using linked lists.
- Hash Table with Linear Probing: Resolves collisions by finding the next available slot.
The technical documentation provides detailed characteristics and functionalities of each implemented data structure. It includes a comprehensive testing program to evaluate the performance of each structure.
- Correctness Verification: Ensuring the correctness through rigorous testing and comparison with standard implementations.
- Performance Analysis: Evaluating the efficiency of each data structure in different scenarios.
- Testing Scenarios: Documenting the situations where each implementation is most effective.
- Insertion: Measuring the time taken to insert elements.
- Deletion: Evaluating the efficiency of deletion operations.
- Search: Assessing the speed and efficiency of search operations.
- Generate Datasets:
Make sure to generate datasets using the
DataGeneratorclass. This will create the necessary data for testing and evaluation. - Generate Datasets:
To run performance tests use class
Measureclass. - Follow the documentation: Documentation is accessible here