1. Draw the perfect skip list that results when you insert items with the keys 19, 6, 26,

   9, 2, 12, 25, 7, 21 and 17 in that order into an initially empty perfect skip list.

2. Draw the randomized skip list that results when you insert items with the keys 19, 6, 26, 9, 2, 12, 25, 7, 21 and 17 in that order into an initially empty randomized skip list.

3. Compare the binary search tree with the perfect skip list and with the randomized skip list (regarding the worst-case and average case time complexity of the search, insert & delete operations).

4. Compare depth-first-search with breadth-first-search of graphs.