Computer algorithms for specialized purposes often employ sophisticated data structures. Actual design and implementation involves several tradeoffs, characteristic of engineering design. An improvement in time complexity of a specific operation may be at the expense of improvement in complexity of some other operation(s).

In this project, we implemented three data structures: the Binary Tree, the Red Black Tree and the van Emde Boas priority queue and compared them based on the number of operations and CPU time taken for basic data structure functions such as insertion, search, and predecessor queries. This project was part of a first level computer science course on algorithms and data structures.

---