Shulou(Shulou.com)06/03 Report--

What are the ways to implement linear tables? Many novices are not very clear about this. In order to help you solve this problem, the following editor will explain it in detail. People with this need can come and learn. I hope you can gain something.

There are two ways to realize the linear table, namely: 1, sequential storage structure, the storage space occupied by elements is continuous and stored in logical order; 2, chain storage structure is a group of arbitrary storage units that can be discontinuous, there are two parts of storage, one is the data field in which the values of data elements are stored, and the other is the pointer domain in which direct precursors or direct successor nodes are stored.

Linear tables have two basic storage structures: sequential storage structure and chain storage structure.

1. Sequence table

It has the following two basic characteristics:

(1) the storage space occupied by all elements of the linear table is continuous.

(2) the data elements in the linear table are stored in logical order in the storage space.

2. Chain storage of linear table

The linked storage structure of a linear table is to store the data elements of a linear table with a set of arbitrary storage units (which can be discontiguous).

Each data element in a linear table needs to be stored in two parts: one is used to store the value of the data element, called the data field, and the other is used to store the address (pointer) of the direct precursor or direct successor node, which is called the pointer domain. this kind of storage unit is called a node.

3. Circular linked list

Circular linked list (Circular Linked List) is another form of linked storage structure. It points the pointer of the last node in the single linked list to the head node of the linked list, so that the whole linked list is connected to each other to form a ring.

4. Two-way linked list

Two-way chaining uses two pointers to represent the logical relationship between nodes. That is, a pointer domain pointing to its direct precursor is added, so that the linked list has two chains in different directions, the precursor and the successor, so it is called a double linked list.

Typedef struct DNode {ElemType data; struct DNode * prior; struct DNode * next;} Dnode,*DuLinkList

5. the form of definition in the process of practical use.

Is it helpful for you to read the above content? If you want to know more about the relevant knowledge or read more related articles, please follow the industry information channel, thank you for your support.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.