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

In this issue, the editor will bring you about the characteristics of the linked list. The article is rich in content and analyzes and narrates it from a professional point of view. I hope you can get something after reading this article.

The characteristic of a linked list is that a set of arbitrary storage units are used to store the data elements of a linear table, so in order to represent the logical relationship between each data element and its direct successor, for the data element, in addition to storing its own information, it is also necessary to store information indicating its direct successor.

Characteristics

Single linked list with nodes at the end of the arrow

The chained storage representation of a linear table is characterized by using an arbitrary set of storage units to store the data elements of a linear table (which can be continuous or discontiguous). Therefore, in order to represent the logical relationship between each data element and its immediate successor, for a data element, in addition to storing its own information, it is also necessary to store information indicating its direct successor (that is, the storage location of the direct successor). These two pieces of information form a "node" (as shown in the figure next to the overview) that represents a data element in a linear table. The linked storage of linear tables shows that one disadvantage is that to find a number, you have to start from scratch, which is very troublesome.

Depending on the situation, you can also design other extensions of the linked list yourself. However, data is generally not attached to the edges, because the points and edges of the linked list are basically one-to-one (except for the first or last node, but there are no special cases). One exception, however, is that if the linked list supports reversing the front and back pointers in a segment of the linked list, the reverse tag may be more convenient to add to the edge.

For non-linear linked lists, you can see other relevant data structures, such as trees and graphs. In addition, there is a data structure based on multiple linear linked lists: jump table, insert, delete, search and other basic operations can reach O (nlogn), the same as the balanced binary tree.

The domain where the data element information is stored is called the data domain (let the domain name be data), and the domain that stores the direct subsequent storage location is called the pointer domain (let the domain name be next). The information stored in the pointer domain is also called a pointer or chain.

Represented by, respectively, The linked list composed of N nodes in turn is called the linked storage representation of linear list. Because each node of this kind of linked list contains only one pointer domain, it is also called single linked list or linear linked list.

These are the characteristics of the linked list shared by the editor. If you happen to have similar doubts, you might as well refer to the above analysis to understand. If you want to know more about it, you are welcome to follow the industry information channel.

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.