Answer: C. Linear structure, nonlinear structure.

The logical structure of data: refers to the data structure that reflects the logical relationship between data elements. The logical relationship refers to the before and after relationship between data elements, regardless of their storage location in the computer. . Logical structures include:

1. Set;

2. Linear structure;

3. Tree structure;

4. Graphics structure.

"Data Structure"

The logical structure of data in the data structure course is divided into linear structure and non-linear structure.

For data structure courses, simply put, a linear structure is an ordered (ordered) set of n data elements. It has four basic characteristics:

1. There must be only one "first element" in the set;

2. There must be only one "last element" in the set;

3. Except for the last element, all other data elements have unique "successors";

4. Except for the first element, all other data elements have a unique "predecessor".

Linear structure in data structure refers to a data structure in which there is a "one-to-one" linear relationship between data elements.

For example (a1, a2, a3,...,an), a1 is the first element and an is the last element. This set is a linear structure set.

Corresponding to the linear structure, the logical characteristic of the nonlinear structure is that one node element may correspond to multiple direct predecessors and multiple successors.

Commonly used linear structures include: linear list, stack, queue, double queue, array, and string.

Regarding the generalized table, it is a non-linear data structure.

Common nonlinear structures include: trees (binary trees, etc.), graphs (nets, etc.).

Reference materials and links:

1. Data structure:

/link?url=A8CfjoxDwsiPDRnIoWuo6-i-ureREm_VgwPzgWyiePwNUFQ2MkgF5woK55Gy9cYbz-6Yf3kdjhJChczuCDgzN27a2gH1mmiVFdVyTt BPEQSaoetMVU8mC2KPUNMXX7lq;

2. Linear structure:

/view/390966.htm.