A linked list is a linear data structure where each element (node) contains data and a pointer to the next node.

 Types: Singly Linked List, Doubly Linked List.

Advantages: Dynamic sizing, efficient insertions/deletions.

Disadvantages: Sequential access (no random access).