C++面向对象程序设计，7th之课件13（第13章）.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Display 13.8 Slide 13- * Next Back Display 13.9 Slide 13- * Back Next Display 13.10 Slide 13- * Next Back Display 13.11 Slide 13- * Back Next Display 13.12 Slide 13- * Back Next Display 13.13 Slide 13- * Next Back Display 13.14 (1/2) Slide 13- * Back Next Display 13.14 (2/2) Slide 13- * Next Back Display 13.15 (1/3) Slide 13- * Back Next Display 13.15 (2/3)  Slide 13- * Next Back Display 13.15 (3/3) Slide 13- * Back Next Display 13.16 Slide 13- * Back Next Display 13.17 Slide 13- * Back Next Display 13.18 (1/2) Slide 13- * Back Next Display 13.18(2/2) Slide 13- * Back Next Display 13.19(1/2) Slide 13- * Back Next Display 13.19 (2/2) Slide 13- * Back Next Display 13.20 Slide 13- * Back Next Display 13.21 (1/2) Slide 13- * Back Next Display 13.21 (2/2) Slide 13- * Back Next Display 13.22 (1/2) Slide 13- * Back Next Display 13.22 (2/2) Slide 13- * Back Next * * * * * * * * * * Slide 13- * Iterator Example Using the previous outline of an iterator we can display the contents of a linked list in thisway: NodePtr iter; for (iter = Head; iter != NULL; iter = iter-Link) cout (iter-data); To insert a node after a specified node in the linked list: Use another function to obtain a pointer to the node after which the new node will be inserted Call the pointer after_me Use function insert, declared here to insert the node: void insert(NodePtr after_me, int the_number); Slide 13- * Display 13.8 Inserting a Node Inside a List Slide 13- * Inserting the New Node Function insert creates the new node just as head_insert did We do not want our new node at the head of the list however, so… We use the pointer after_me to insert the new node Slide 13- * head after_me temp_ptr 2 2 3 2 7 2 9 0 5 2 Inserting the New Node This code will accomplish the insertion of the new node, pointed