This paper presents an empirical evaluation of different implementations of an abstract data structure, the ordered dictionary. The implemented data structures are Binary Search Tree, AVL Tree, Red-Black Tree, Zip Tree, Skip List and 2-3 Tree. The paper aims to take a step forward in evaluating of data structures with ALGator. It also compares the Zip Tree with other ordered dictionaries to encourage the use of it as a simpler and comparable implementation.The result of the testing the data structures, both with strictly increasing (worst case scenario) and random updates and query operations, shows that the time complexity is the same as expected.