Home > Common Problem > What is the condition for determining that the head of a singly linked list with the head node is empty?

What is the condition for determining that the head of a singly linked list with the head node is empty?

王林
Release: 2020-07-02 14:25:19
Original
30155 people have browsed it

The condition for determining whether the head of a singly linked list with the head node is empty is: [head->next==head]. A singly linked list is a chained access data structure that uses a set of storage units with arbitrary addresses to store data elements in a linear list. The data in the linked list is represented by nodes, and each node is composed of elements and pointers.

What is the condition for determining that the head of a singly linked list with the head node is empty?

The judgment condition that the head of a singly linked list with the head node is empty is: head->next==head.

Related introduction:

Singly linked list

Singly linked list is a chained access data structure, using a The storage unit with any group address stores the data elements in the linear table.

The data in the linked list is represented by nodes. Each node is composed of: element (image of data element) pointer (indicating the storage location of subsequent elements). The element is the storage unit where data is stored. The pointer is the address data connecting each node.

Node structure

What is the condition for determining that the head of a singly linked list with the head node is empty?

data field--the data field that stores node values

next field- -The pointer field (chain field) that stores the address (location) of the direct successor of the node

The linked list links the n nodes of the linear list together in their logical order through the link field of each node. , a linked list with only one link domain for each node is called a singly linked list.

HeadPointer head and terminal node

The storage address of each node in a singly linked list is stored in its predecessor node next In the domain, the starting node has no predecessor, so the head pointer should be set to point to the starting node. A linked list is uniquely determined by the head pointer, and a singly linked list can be named after the head pointer.

The terminal node has no successor, so the pointer field of the terminal node is empty, that is, NULL.

The above is the detailed content of What is the condition for determining that the head of a singly linked list with the head node is empty?. For more information, please follow other related articles on the PHP Chinese website!

Related labels:
source:php.cn
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Popular Tutorials
More>
Latest Downloads
More>
Web Effects
Website Source Code
Website Materials
Front End Template