the time complexity of Skip List
-
05-07-2021 - |
Question
May I know why the time complexity of insertion of skip list is O(log n) for average case, and why the height of Skip list with n elements is O(log n) in high probability. And why average search time in each layer is O(1).
Solution
I can help with the O(log n) part.
Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow