{"ref":"master","ref_type":"branch","master_branch":"master","description":"This program takes a long list of key-value pairs and inserts them into a skiplist and a binary search tree. The main aim of this project was to compare the search efficiency of a skip list versus a binary search tree by searching for keys. Tests were devised with a large amount of key-value pair insertions, and the time taken for each test was then recorded with the number of comparisons required also being noted. Coded in C.","pusher_type":"user"}