What is linear data structure

What is a linear data structure?

A linear structure is a collection of ordered data elements.

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

About generalized tables and arrays, they are a non-linear data structure.

Common nonlinear structures include: two-dimensional arrays, multi-dimensional arrays, generalized tables, trees (binary trees, etc.)

Classification

Data structure courses The logical structure of data is divided into linear structure and non-linear structure.

For the data structure course, simply put, a linear structure is an ordered (ordered) set of n data elements.

Features

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 (a0,a1,a2,...,an), a0 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.

The above is the detailed content of What is linear data structure. For more information, please follow other related articles on the PHP Chinese website!