Question

How can I merge 2 given Skip lists (each with n keys) into a one single Skip List in O(n) time complexity (worst case)?

Just looking for the algorithm - no particular implementation/language.

No correct solution

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top