Skip to content

Readme

Linked List Time Complexity Table

Operation Singly-Linked List Doubly-Linked List Circular Linked List
Access Head O(1) O(1) O(1)
Insert Head O(1) O(1) O(1)
Delete Head O(1) O(1) O(1)
Access Tail O(n) O(1) O(n)
Insert Tail O(n) O(1) O(1)
Delete Tail O(n) O(1) O(1)
Access Middle O(n) O(n) O(n)
Insert Middle O(n) O(n) O(n)
Delete Middle O(n) O(n) O(n)
Search for a Value O(n) O(n) O(n)