1. Linked Lists Data Structures & Problem Solving Using JAVA Second Edition Mark Allen Weiss Chapter 17 © 2002 Addison Wesley

2. Figure 17.1 Basic linked list Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

3. Figure 17.2 Insertion in a linked list: Create new node (tmp), copy in x, set tmp’s next link, and set current’s next link Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

4. Figure 17.3 Deletion from a linked list Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

5. Figure 17.4 Using a header node for the linked list Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

6. Figure 17.5 Empty list when a header node is used Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

7. Figure 17.15 A doubly linked list Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

8. Figure 17.16 An empty doubly linked list Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

9. Figure 17.17 Insertion in a doubly linked list by getting new node and then changing pointers in the order indicated Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

10. Figure 17.18 A circularly and doubly linked list Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

11. Figure 17.31 (A) Commands for editor in Exercise 17.19 (continued) Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

12. Figure 17.31 (B) Commands for editor in Exercise 17.19 (continued) Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley