previous |
start |
next
Efficiency of Linked List
- Adding or removing an element
- A fixed number of link references need to be modified
to add or remove a link, regardless of the size of the list
- Thus, an element can be added or moved in constant time
- In big-Oh notations: O(1)
previous |
start |
next