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

Most people don't understand the knowledge points of this "php linked list" article, so Xiaobian summarizes the following contents for everyone. The contents are detailed, the steps are clear, and they have certain reference value. I hope everyone can gain something after reading this article. Let's take a look at this "php linked list" article together.

In php, linked list is a basic data structure, a linear table; linked list will dynamically store allocation, can adapt to the dynamic increase and decrease of data, and can easily insert and delete data items. There are three different types of linked lists: single-linked lists, double-linked lists, and circular linked lists.

Operating environment of this tutorial: Windows 7 system, PHP7.1 version, DELL G3 computer

List in PHP

A linked list is a common basic data structure, a linear table, but does not store data in linear order, but a pointer to the next node in each node.

The linked list dynamically stores and allocates data, which can adapt to the dynamic increase and decrease of data, and can insert and delete data items conveniently. (When inserting or deleting data items in an array, you need to move other data items, which is very cumbersome.) The linked list must find the next element according to the next pointer.

The linked list structure can overcome the disadvantage that array linked list needs to know the size of data in advance, and the linked list structure can make full use of computer memory space and realize flexible memory dynamic management. But linked lists lose the advantage of random array reading, and linked lists have a large space overhead due to the increase of pointer fields of nodes.

There are three different types of linked lists: single-linked lists, double-linked lists, and circular linked lists.

singly-linked list

A unidirectional list contains two fields, an information field and a pointer field. This link points to the next node in the list, and the last node points to a null value.

As shown in the figure:

doubly linked list

Each node has two connections: one to the previous node (null or empty list when this Connection is the first Connection) and one to the next node (null or empty list when this Connection is the last Connection)

As shown in the figure:

circulation link list

In a circular linked list, the first and last nodes are linked together. This can be done in both unidirectional and doubly linked lists. To convert a circular list, you start at any node and then follow the list in any direction until you return to the starting node. Alternatively, circular lists can be thought of as "headless and tailless." Such lists are good for saving data storage cache, assuming you have one object in a list and want all other objects iterated under a non-specific arrangement. A pointer to the entire list may be referred to as an access pointer.

The above is the content of this article about "what is the php linked list". I believe everyone has a certain understanding. I hope the content shared by Xiaobian will help everyone. If you want to know more relevant knowledge, please pay attention 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.