Goals: Working with dynamic arrays, pointers, doubly linked lists
The starter code can be downloaded from https://github.com/ajahanba/342/tree/main/ass4-skiplist-starter-master (Links to an external site.)
For this assignment, you will write a Skip List data structure to store integers. When searching a Skip List, items can be found in O(log n) time. No duplicates are allowed.
A SkipList can have multiple levels. SkipList of depth 1 is similar to a doubly linked list. All elements are inserted into a single doubly linked list.