Name a common linear data structure.

An array is a common linear data structure because it stores a collection of elements in a sequential manner. Each element in an array is identified by an index, allowing for easy access and manipulation of the elements using their position.

The linear nature of an array means that its elements can be traversed in a single sequence, from the first to the last element. Arrays are typically used for their efficient access times, as retrieving an element by index is a constant time operation (O(1)).

The other options, while essential data structures in computer science, do not fit the definition of linear data structures as clearly as arrays do. A binary tree is a hierarchical structure where each node can have multiple child nodes, forming a branching pattern. Graphs represent a collection of nodes connected by edges and can have complex relationships that are not linear. A hash table is a data structure that uses a hash function to map keys to values, allowing for efficient data retrieval but without maintaining a linear sequence.