The data structure typically used in a linked list is a node. Each node consists of two main components: the data it holds and a reference (or pointer) to the next node in the sequence. This structure allows for efficient insertion and deletion of elements, as nodes can be easily added or removed without needing to shift other elements, unlike arrays. Linked lists are fundamental data structures in programming and are widely used in various algorithms and applications.