Lecture-20

書籍內容簡介

Lecture 20: More on linked lists Summary of Lecture: Operations of linked lists Types of linked lists Deleting the Node with a Given ITEM of Information: Let LIST be a linked list in memory. Suppose we are given an ITEM of information and we want to delete from the LIST the first node N which contains ITEM. (If ITEM is a key value, then only one node can contain ITEM.) Recall that before we can delete N from the list, we need to know the location of the node preceding N. Accordingly, first we gi…