Advanced-Data-Structures-Lab

---

Repo for Assignments & Projects done for IT203TLP ~ Advanced Data Structures, VIT, Pune.

• Assignment 1: Implementation of Red Black Tree Data Structure for storing set of integer keys and perform the following operations.

1. Insert ()
2. Delete ()
3. Search ()

After each operation (insert, delete) Display the corresponding rotation or colour change that took place.

• Assignment 2: Implementation of B-Tree and operations such as:

1. Insert()
2. search()
3. Traverse()

Order of B tree must be greater than 10.

• Assignment 3: Implementation of Van Emde Boas Tree. and the following operations

1. insert
2. MIN/MAX
3. Predessor/Successor
4. Member
5. Delete

on Universe Size >=32

• Assignment 4: Implementation of Binomial Heap Data Structure for the following operations on binomial heap.

1. find min()
2. extract Min()
3. Union()
4. Decrease key()
5. Delete key()

• Assignment 5: Implementation of Position Heap Data Structure and perform following operations

1. Build Position Heap
2. Query position Heap.

• Assignment 6: Implementation of Skip List to maintain student database such as Name, Roll_Number, Marks, Phone_number using skiplist and perform

1. insert()
2. search()
3. delete()
4. find_nth_smallest() find_records_within_range()//E.g. from roll_no 20 to roll_no 35 et. all

• Assignment 7: Implementation of Point-Region Quadtree to perform following operations.

1. Create()
2. Search()
3. RangeQuery()//this function will take the input as rectangular query region and returns the set of points falling inside or on the boundaries of the rectangular query region.

• Assignment 8: Implementation of K-D Tree such that Number of dimensions(k) will be given at run time. Your implementation should be able to perform

1. Create().
2. Insert(point)
3. Search(point)
4. FindMin(dim)//for Given dimension
5. Delete(point)
6. NearestNeighbour(point).