chapter11More Linking Up with Linked Lists课件.pptVIP

Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, ? 2005 Pearson Education, Inc. All rights reserved. 0-13-140909-3 More Linking Up with Linked Lists Chapter 11 Chapter Contents 11.1 Some Variants of Singly-Linked Lists 11.2 Linked Implementation of Sparse Polynomials 11.3 Doubly-Linked Lists and the Standard C++ list 11.4 Case Study: Larger-Integer Arithmetic 11.5 Other Multiply-Linked Lists Chapter Objectives Survey common variants of linked lists and why they are used Study in detail an application of linked lists to implement sparse polynomials Describe doubly-linked lists and how they are used to implement C++ STL list container Build a class that makes it possible to do arithmetic with large integers Look briefly at some other applications of multiply-linked lists Linked Lists with Head Nodes Consider linked lists from Chapter 6 First node is different from others Has no predecessor Thus insertions and deletions must consider two cases First node or not first node The algorithm is different for each Linked Lists with Head Nodes Dual algorithms can be reduced to one Create a dummy head node Serves as predecessor holding actual first element Thus even an empty list has a head node Linked Lists with Head Nodes For insertion at beginning of list Head node is predecessor for new nodenewptr-next = predptr-next;predptr-next = newptr; Linked Lists with Head Nodes For deleting first element from a list with a head node Head node is the predecessorpredptr-next = ptr-next;delete ptr; Circular Linked Lists Set the link in last node to point to first node Each node now has both predecessor and successor Insertions, deletions now easier Special consideration required for insertion to empty list, deletion from single item list Circular Linked Lists Traversal algorithm must be adjustedif (first != 0) // list not empty{ ptr = first; do  { // process ptr-data ptr = ptr-next; } while (ptr != first); } A do-w