Operations
Search
$$O(n)$$
Access
- At beginning: $O(1)$
-
At end: $O(n)$
-
To access an element, it has to iterate over each node (starting from the root node) until the desired element is found
Insert
- At beginning: $O(1)$
-
At end: $O(n)$
-
To write at a specific index, first the list need to be iterated until the desired position and then change the reference to the next element
Delete
- At beginning: $O(1)$
- At end: $O(n)$