Splay-Tree

Implementation of Splay Tree (a self balancing Binary Search Tree) in Python Programming Language.
This implementation is Course Project of Course "Data Structures & Algorithms" (CS-211)

Operations:

1. Searching (by Splaying)
   
2. Insertion (by Splaying)
   
3. Deletion (by Splaying) [2 Cases of Deletion]
   
   • Case 1: Top-Down-Delete (first splay, then delete)
     
   • Case 2: Bottom-Up-Delete (first delete, then splay its parent)

Contributors

• Anusha (https://github.com/Anushakhalil)
• Shahzaib (https://github.com/shahzaibk23)