A linear data structure
A) always has more than one link per node
B) is sometimes represented as a tree or a graph
C) can have only a single link per node
D) almost always is kept in sorted order, either ascending or descending
E) None of these

Question

Quizplus · Accepted Answer

A linear data structure is one where data elements are arranged sequentially or linearly where each element except the first and last has a predecessor and a successor. In such structures, each node has only one link pointing to its successor, hence there can be only a single link per node. Options A and D are incorrect as they suggest otherwise. Option B is incorrect because although a linear structure can be represented as a tree or a graph, it does not mean that all linear structures are represented in this manner.

A Linear Data Structure