If we had a linked list that would never be modified, we can use a simpler approach
Question:
If we had a linked list that would never be modified, we can use a simpler approach than the Skip List to speed access. The concept would remain the same in that we add additional pointers to list nodes for efficient access to the \(i\) th element. How can we add a second pointer to each element of a singly linked list to allow access to an arbitrary element in \(\mathrm{O}(\log n)\) time?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Practical Introduction To Data Structures And Algorithm Analysis Java Edition
ISBN: 9780136609117
1st Edition
Authors: Clifford A. Shaffer
Question Posted: