Learning Exercise – C++ Linked List （练习- C + +链表）.pdfVIP

Modul Info1 – Informatik 1 Page 1/ 15 Learning Exercise – Linked List R. Baumann Time budget: 25 minutes Task: Work alone through this learning exercise. Follow the working instructions marked with a pen. The learning exercise consists of eight parts. You will probably not be able to finish everything during the lecture. If you get up to part number four it’s already fine. Finishing this paper will be part of exercise number eleven. Target: You learn what linked lists are and how to handle them. Beside you repeat pointers and dynamic data object management. Contents: 1. What is a linked list? 1 2. Defining the data structure for a linked list 2 3. Adding a node to the end of the list 2 4. Displaying the list of nodes 5 5. Deleting a node from the list 6 6. Navigating through the list 12 7. Double Linked Lists 15 8. and so on . .. 15 1. What is a linked list? A linked list is a data structure which is built from structures and pointers. It forms a chain of nodes with pointers representing the links of the chain and holding the entire thing together. A linked list can be represented by a diagram like this one: This linked list has four nodes in it, each with a link to the next node in the series. The last node has a link to the special value NULL The NULL pointer has been presented in the lecture and is used here, to show that it is the last link in the chain. There is also another special pointer, called Start or Root, which points to the first link in the chain so that we can keep track of it.