Because standard linked lists use traversal methods instead of quick memory access like arrays it’s computationally straining to traverse through 1000000 elements. A skiplist skips nodes by adding an additional dimension to the linked and its probabilistic for adding and removing nodes where as the idealized version requires reconstructing the entire list.
Implementing a probabilistic skiplists.
Because standard linked lists use traversal methods instead of quick memory access like arrays it’s computationally straining to traverse through 1000000 elements. A skiplist skips nodes by adding an additional dimension to the linked and its probabilistic for adding and removing nodes where as the idealized version requires reconstructing the entire list.