1. PROJECT -1 (4 points) Week before midterm, C++.
Use templates
Binary search tree
Heap
AVL trees (last number of mystudentid % 3 == 0)
2-3 trees or B tree (last number of mystudentid % 3 == 1)
Red-black tree (last number of mystudentid % 3 == 2)
Read data from my web site (integers, 500,000)
Search data (from my web site 50,000)
Delete data (from my web site 50,000) heap will delete by using delete minimum function, not by deleting the given numbers
Insert them into the BST.
Delete numbers
Search numbers
Give a comparison report with the execution times.
Write the insertion, search and deletion complexity analysis of the operations for each data structure.