《4Linked List Data Structures》-公开·课件设计.pptVIP

4Linked List Data Structures Linked lists: singly-linked and doubly-linked. Insertion. Deletion. Searching. Linked lists (1) A linked list consists of a sequence of nodes connected by links, plus a header. Each node (except the last) has a successor, and each node (except the first) has a predecessor. Each node contains a single element (object or value), plus links to its successor and/or predecessor. Linked lists (2) The length of a linked list is the number of nodes. An empty linked list has no nodes. In a linked list: We can manipulate the individual elements. We can manipulate the links,