previous
|
start
|
next
Efficiency of Linked List
Random access
On average
n
/2 elements need to be skipped
In big-Oh notation: O(
n
)
previous
|
start
|
next