Chapter 5 linked list-double-ended linked list

The double-ended linked list is very similar to the traditional linked list. The only difference is that a last reference points to the end of the linked list. Therefore, you can add nodes at the end of the linked list. It takes O (1) to add nodes to the head and tail of the linked list ). If a node is deleted, the chain table header is O (1) and the end of the chain table is O (n ).

The reason for deleting the End Node of the linked list is O (n): Delete the N node, the next of the N-1 node needs to point to null, so you need to find the N-1 node, this operation takes O (n ). To solve this problem, two-way linked list will be introduced later in this chapter. Note the difference between "double"DirectionLinked List and doubleEndLinked List ".