Linked 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, thus changing the linked list’s very structure! (This is impossible in an array.) Singly-linked lists (1) A singly-linked list (SLL) consists of a sequence of nodes, connected by links in one direction only. Each SLL node contains a single element, plus a link to the node’s successor (or a null link if the node has no successor). An SLL header contains a link to the SLL’s first node (or a null link if the SLL is empty). Singly-linked lists (2) Java class implementing SLL nodes: public class SLLNode { protected Object element; protected SLLNode succ; public SLLNode (Object elem, SLLNode succ) { this.element = elem; this.succ = succ; } } Singly-linked lists (3) Java class implementing SLL headers: public class SLL {? private SLLNode first; public SLL () { // Construct an empty SLL. this.first = null; } … } Example 1: SLL traversal Instance method (in class SLL) to traverse an SLL: public void printFirstToLast () {// Print all elements in this SLL, in first-to-last order. for (SLLNode curr = this.first; curr != null; curr = curr.succ) System.out.println(curr.element);} Animation: Example 2: SLL manipulation (1) Instance method (in class SLL) to delete an SLL’s first node: public void deleteFirst () {// Delete this SLL’s first node (assuming length 0). this.first = this.first.succ;} Animation: Example 2 (2) Instance method (in class SLL) to