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 but a single link per node
D) almost always is kept in sorted ordereither ascending or descending
E) none of the above

Question

Quizplus · Accepted Answer

C) A linear data structure is one that, when you draw a picture of it, displays as a line of connected nodes. It is "linear"-looks like a line. A simple list is an example of such a data structure-so a linear data structure may have as few as one link per node. Data structures that display as trees or graphs are not linear-they are two-dimensional (at least). There is no requirement (or convention) that linear data structures be kept in any kind of order, sorted or otherwise.

A Linear Data Structure