《软件技术基础教学课件》4.4 linklist.pptVIP

Page * * Searching a Linked List Notice that both the insert and delete operations on a linked list must search the list for either the proper insertion point or to locate the node corresponding to the logical data value that is to be deleted. //search the nodes in a linked list pPre NULL; pCur pHead; //search until the target value is found or the end of the list is reached while pCur ! NULL pCur - data ! target pPre pCur; pCur pCur - next; //determine if the target is found or ran off the end of the list if pCur ! NULL found 1; else found 0; Page * * Traversing a Linked List List traversal requires that all of the data in the list be processed. Thus each node must be visited and the data value examined. //traverse a linked list Struct node *pWalker; pWalker pHead; printf “List contains:\n” ; while pWalker ! NULL printf “%d ”, pWalker - data ; pWalker pWalker - next; Page * * Practice Problems Using a Linked List Create C functions to solve the following problems with linked lists. We’ll create solutions in the next class, but you try them first! Write a recursive function that will search a list for a specific item, returning NULL if it is not found and a pointer to the node containing the value if it is found. Write a function that will insert a node pointed to by newnode before the node pointed to by target. head target newnode Linked Lists in C and C++ * Linked List struct listItem type payload;struct listItem *next; ; payload next payload next payload next payload next Note: payload may bemultiple members. Linked Lists in C and C++ * Linked List continued Items of list are usually same type Generally obtained from malloc Each item points to next item Last item points to null Need “head” to point to first item! “Payload” of item may be almost anything A single member or multiple members Any type of object whose size is known at compile time Including struct, union, char * or other pointers Also arrays of fix