Create Project for Integrated Programming Algorithms and Data Structures

Task 1 populates three different data structures and compares their search times against each other. In theory, a binary search tree should be able to output perform a linked list for searching on large data sets, and a balanced binary search tree even more so. But is this true in all circumstances? Is there a clear winner?Binary search trees are quite quick to search through if you are looking for a particular node. These patterns are branched out to solve all sorts of problems, from storing data in a map with easy retrievals, to organising 3D elements in a game to render only those on screen at the time.

Task 2 asks you to delve into a more complicated aspect of object-oriented programming, polymorphism. To show this level of understanding, you will need to implement a class hierarchy and max heap data structure to house 10 or more employees, sorted with highest salary on the top. Polymorphism allows you to conveniently group similar but different objects together, amongst other benefits.