Linear structure

understand ： Each element has only one out degree and one in degree , As a line . Linear lists are divided into sequential lists and linked lists according to the storage structure .

Storage structure

1. Sequential storage

Data elements in a linear table are sequentially stored in a set of storage units with continuous addresses , Make logically adjacent elements , Physically adjacent .

2. Chain store

The address of the node storing each element can be discontinuous , Data elements are logically adjacent , But physically separate .

1. Single chain list

Each element has a data field and a pointer field , Each data field stores the data of the current node , Each pointer field stores the address of the next element node .

2. Circular linked list

The basic principle is the same as that of single linked list , But the pointer field of the last element node of the circular linked list points to the head pointer .

3. Double linked list

The basic principle is the same as that of single linked list , But the elements of a two-way linked list have two pointer fields and one data field , A pointer field points to the address of the previous element , A pointer field points to the address of the next element .