Which of the following is an example of a linear data structure?

A linear data structure is characterized by its organization in a sequential manner where each element is connected to its previous and next elements. This type of structure allows for efficient traversal, as the data is stored in a linear form, which makes accessing elements straightforward.

An array is a prime example of a linear data structure. In an array, elements are stored in contiguous memory locations, and each element can be accessed using an index. Because of this direct access combined with the order of the elements, arrays exhibit linearity in their organization.

In contrast, linked lists, graphs, and trees do not maintain a straightforward linear structure. While linked lists can be thought of as linear due to the way nodes are connected sequentially, they allow for more complex relationships and do not utilize contiguous memory. Graphs are collections of vertices and edges that represent relationships, making them non-linear. Trees, although they can conceptually represent hierarchy in a linear traversal manner, consist of nodes with multiple connections that create a branching structure rather than a simple sequence.