Skip-lists-VS-Binary-search-Tree

This project aims at performing a comparative study between Binary Search Tree and Skip - Lists

Instructions

main.c contains the entire program which consists of implementing skip lists and binary search tree and then analyzing them on set of randomly generated numbers
The file Results of comparative study.pdf contains a pdf file where there is a detailed description and analysis that is carried out based on the results

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
bin/Debug		bin/Debug
obj/Debug		obj/Debug
README.md		README.md
Results of comparative study.pdf		Results of comparative study.pdf
main.c		main.c
main.exe		main.exe
main.o		main.o
randomnumbers.txt		randomnumbers.txt
skip.cbp		skip.cbp
skip.depend		skip.depend
skip.layout		skip.layout