List #

Data access is slow $(O(n))$.

Data insertion and deletion are fast $(O(1))$.

There are singly, doubly, and circular linked lists.