循环链表 双向链表及操作(国外英语资料).docVIP

循环链表 双向链表及操作(国外英语资料) Circular list \ bidirectional linked lists and operations One, loop linked lists Circular linked list is like singly linked lists, is a kind of storage structure of the chain, the difference is that the end of the circular linked list is a node pointer points to the circular linked list of nodes or header first, so as to form a ring chain. The operation of the loop linked list is basically the same as that of a single linked list. Different things have the following: When creating a loop list, the pointer to the last node must be directed to the header, instead of being NULL as a single linked list. This is also used to insert a new node after the last node. At the end of the table, it is determined whether the value of the chain domain of the node is the header node, and when the value of the chain domain is equal to the header pointer, the end of the table is indicated. Rather than determining whether the chain domain value is NULL as a single linked list. Two, two-way linked lists A two-way list is actually a single linked list. When we do a single linked list, sometimes you have to start looking at a nodes direct drive. This is restricted by the structure of the single linked list nodes. Because singly linked lists each node only one store chain domain address immediate successor nodes, so cant define a both store chain domain address immediate successor nodes, and there was a store chain domain address immediate predecessor nodes of a double chain field node structure like this? This is a two-way list. In the bidirectional linked list, the node has two chains, besides the data region, and a direct successor address, commonly referred to as the right chain. A storage direct precursor address, commonly referred to as the left chain. In the c language, the double linked list node type can be defined as: Typedef struct node { The int data; / * data domain * / Struct. / * chain domain, * llink is the left chain pointer, * rlink is the right chai