Is the only form of storage for linear tables a linked list?

Each step must be given to the next one, otherwise the next pointer is suspended.

The chained storage structure of a linear table is a sequential storage structure.

Each storage node in the chain storage structure of a linear table contains not only a data element, but also a pointer, and each pointer points to a node that has a logical relationship with the node, and this storage mode belongs to sequential storage. Linear tables are the most basic, simplest, and most commonly used type of data structure. A linear list is a type of data structure, and a linear table is a finite sequence of n data elements with the same characteristics.

The address of the sequential storage structure is continuous in memory, so random access can be achieved by calculating the address, while the storage address of the chain storage structure is not necessarily continuous, and can only be accessed sequentially through the pointer of the first node.

So choose B, that is, it can only be stored sequentially.

Use any set of storage cells to hold the nodes of a linear table, and different groups of storage cells can be either continuous or discontinuous.

Linear tables have two storage structures: sequential tables and linked lists.

Linked list: An arbitrary set of storage units that hold the nodes of a linear table, which can be either continuous or discontinuous.

Answer]: A This question tests the knowledge of data structure consolidation.

When a linear table is stored in a single-linked list, each element is represented by a node, and the pointer field in the node indicates the node where the successor element is located. Inserting and deleting elements on a singly linked list only requires modifying the pointer field of the node where the logically related element is located, while burying the reputation does not require moving the element.

Regarding the chain storage of linear tables, the following statement is correct ()aIt is easy to insert and delete.

b.The density of storage and storage is large.

c.Convenient random access.

d.None of the above.

The only way to do this is to search for the answer: a

A linear table is a logical structure that is stored in two ways, sequential and chained.

Sequential storage corresponds to sequential tables, and chain storage corresponds to single-linked lists, doubly linked lists, circular linked lists, and static linked lists.

Among them, the chain storage of linear tables is also known as singly linked lists.

Note: Doubly linked lists, circular linked lists, etc., are all derived from the performance of a single chain.

Single-linked list: a successor pointer, a head node, and a head pointer. Each node is where the next node is stored, so the last node is null, which is a null value.

Doubly linked list: There are two pointers in a doubly linked list node, the previous and the next, that is, there are a precursor and a successor pointer, which point to the predecessor and successor nodes, respectively.

Circular linked lists: The difference between a circular linked list and a single linked list is that the pointer to the last node is not null (let's go back to the knowledge of a single linked list), but points to the head node, so that the whole linked list becomes a ring.

Circular doubly linked list: The pointer of the head node in a circular doubly linked list also points to the end of the table.

Note: In a circular doubly linked list L, when the circular doubly linked list is empty, the Prior and Next fields of the head node are equal to L.

Static linked lists: Static linked lists are chained storage structures that describe linear tables with the help of arrays. Nodes have a data field and a pointer field.

According to my understanding: in fact, static linked lists and single linked lists are similar in structure, but static linked lists are very similar to sequential lists, and static linked lists can be regarded as a combination of single linked lists and sequential lists.

That's all there is to the chained storage structure.

Use any set of storage cells to store linear tables.

The different groups of memory cells can be either continuous or discontinuous.

Linear tables have two storage structures: sequential tables and linked lists.

Linked list: A set of arbitrary key storage units that can be either continuous or discontinuous to store the nodes of a linear table.

Extended Information: Linear Table Classification:

When we say "linear" and "nonlinear", we only discuss it at the logical level, without considering the storage level, so biacutely linked lists.

and circular linked lists are still linear.

in the data structure.

Subdivided at the logical level, linear tables can be divided into general linear tables and restricted linear tables. Generally, linear tables are what we usually call "linear tables", and nodes can be deleted or added freely. Restricted linear tables mainly include stacks and queues, and restricted means that the operation on nodes is restricted.

Linear Table Advantages:

The logical structure of the linear table is simple, and the hand base is easy to implement and operate. Therefore, the data structure of linear table is widely used in practical applications.

In a chained storage design, the storage space of different nodes can be distimate, but the storage unit addresses within the nodes must be continuous.

There are two storage structures of the linear table: the jujube selling order table and the chain with the reed table.

Linked list: A set of arbitrary storage units that hold the nodes of a linear table, either continuous or discontinuous.