In this project we implement the same features for both the array implementationn and the binary search tree implementation. For specifics I reccomend you read the report.

Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However ...