嶋b桃敋湵-LinkedLists.pptVIP

Linked Lists Linked Lists: Basic Idea Data may be stored consecutively in a linked list. Each element of the linked list Stores one piece of data Points to the next element or NULL. Linked lists provide natural implementation. A linked list of integers: Linked Lists: Operations Original linked list of integers: Insertion by pointers: Deletion by pointers: Pointer Based Linked Lists Linked lists store data in increasing order: Definitions: 1. Defining a node (recursive datatype - use itself to define itself!) class node { public: int data; node* next; }; // end class typedef node* ptrType; // ptrType is a pointer to a node typedef typedef allows you to make new shortcuts to existing types typedef int FunnyInt; FunnyInt k; // same as: int k; typedef int* IntPtr; IntPtr p;// same as: int *p; p = new node; *p = 100; Pointer Based Linked Lists Definitions (cont’d): 2. To create/delete node P = new node; delete P; 3. The fields in P can be accessed using: P-data = 100; and P-next = NULL; Alternatively, we could also write: (*P).data = 100; and (*P).next = NULL; Accessing Linked Lists We define a pointer ptrType Head; that points to the first node of the linked list. When the linked list is empty (empty list) then Head is NULL. Traversing a Linked List A linked list is displayed by visiting its nodes one by one, and displaying their data fields. void DisplayList(ptrType Head) { ptrType current = Head; while(current != NULL){ cout current-data endl; current = current-next; } } Traversing a Linked List Alternatively, we can use for loop to traverse a linked list: void DisplayList(ptrType Head){ ptrType cur; for (cur = Head; cur != NULL; cur = cur-next) { cout cur-data endl; } } Displaying a Linked List current = Head; current = current-next; Deleting a Node To delete a node from the list 1. Locate the node to be deleted (a) cur points to the node to be deleted.