Shulou(Shulou.com)05/31 Report--

In this article, the editor introduces in detail "what is the concept of c language linked list". The content is detailed, the steps are clear, and the details are handled properly. I hope this article "what is the concept of c language linked list" can help you solve your doubts. Let's follow the editor's ideas to learn new knowledge.

The concept of linked list

When using an array to store a large amount of data, it is necessary to define a fixed-length array in advance, and when the number of array elements is uncertain, it is necessary to define an array long enough, which will result in a waste of memory space. And depending on how the array is stored, all elements of the array must occupy contiguous memory space.

Linked list is a common and important data structure, which can store multiple data of the same type. It is a data structure for dynamic storage allocation. Therefore, the linked list has no restriction when using arrays, it can apply for memory space dynamically according to the actual needs, and the memory space requested is not required to be continuous.

A node is the basic storage unit of a linked list. A node corresponds to a data element in the linked list, and all nodes have the same data structure. Each node occupies a section of continuous memory space, while discontinuous memory space can be occupied between nodes. Nodes and nodes are linked together by pointers, so they are called linked lists.

Each node in the linked list includes two parts: the data field and the pointer domain, in which the data field stores the data of the node and the pointer domain stores the address of the next node. C language uses structures to define nodes, which are generally in the form of:

Struct node

{

Int data; / / data domain

Struct node * next;// pointer domain

}

Using the above structure type, you can create a basic one-way linked list. The following figure shows the structure of the one-way linked list. In the one-way linked list shown in the following figure, there are several issues to pay attention to:

(1) A pointer variable needs to be defined to point to the first node (that is, the address where the first node is stored), which is called the header pointer.

(2) except for the last node, the pointer domain of other nodes points to the next node.

(3) the pointer field of the last node stores NULL, indicating the end of the linked list. The figure is represented by "∧".

(4) the data field of the node can define multiple data members according to the actual needs of the program.

One-way linked list is the simplest way in the linked storage structure. the most basic feature of the linked storage structure is that each node stores the address of its subsequent nodes and does not need to occupy continuous memory space. The advantages of chain storage structure include flexible and simple operation of inserting and deleting nodes, convenient memory expansion and recycling, and so on. The disadvantage is that the query operation can only be carried out sequentially and the efficiency is low.

After reading this, the article "what is the concept of c language linked list" has been introduced. If you want to master the knowledge points of this article, you still need to practice and use it yourself to understand it. If you want to know more about related articles, welcome to 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.