jaca学习lecture13-LinkList.ppt

Copyright ? 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 13 LinkList Linked Lists Cheatem and Howe head Duey One node in the list Data in a node A link in a node Null link signifying the end of the list null Linked lists consists of objects known as nodes Each node has a place for data and a link to another node Links are shown as arrows Each node is an object of a class that has two instance variables: one for the data and one for the link The head of the list is not a node. ListNode Class:Instance Variables and Constructor public class ListNode { private String data; private ListNode link; public ListNode(String newData, ListNode linkValue) { data = newData; link = linkValue; } Two parameters for the constructor: data value for the new node Link value for the new node Duey Adding a Node To add a node at the beginning of the list: public void addANodeToStart(String addData) { head = new ListNode(addData, head); } The new node will point to the old start of the list, which is what head pointed to. The value of head is changed to point to the new node, which is now the first node in the list. Deleting a Node To delete a node from the beginning of the list: public void deleteHeadNode() { if (head != null) { head = head.getLink(); } else // prints an error message and exits ... Doesnt try to delete from an empty list. Removes first element and sets head to point to the node that was second but is now first. Start at beginning of list Stepping through a List Cheatem and Howe head Duey When position is at this last node, position.getLink() is null and the loop will terminate. null ListNode position; position = head; while (position != null) { ... position = position.getLink(); } position This reference is position.getLink(). Moves to next node in the list. Excerpt from showList in StringLinkedList Node Inner Classes Using an inner class makes StringLinkedList se