Linked List #

Access is $\mathcal{O}(n)$.

While insertion and deletion at known positions are $\mathcal{O}(1)$, those at arbitrary positions are $\mathcal{O}(n)$ due to traversal.

Types: Singly Linked List, Doubly Linked List, Circular Linked List