数据结构与算法国家级双语教学示范课程配套教材彭军向毅Chap2list课件教学.pptVIP

PPT研究院 POWERPOINT ACADEMY * * We begin with a discussion of the data structure required to support a list. We then develop the 10 basic algorithms required to build and use a list. * * * Academy awards list design 2-7 List application Circularly Linked Lists: In this structure, the last node’s link points to the first node of the list. N count pos rear 5 10 95 link 2-8 Complex Linked List Structures Circularly Linked Lists Insertion and deletion is the same from single lists except the last node In addition to updating the rear pointer in the header, also point the link field to the first node The problem on searching : If the search target lies before the current node, how do we find it? What is the target does not exist? The solution: we must save the starting node’s address and stop when we have circled around to it. The code below. Loop (target pLoc-data.key and pLoc-link startAddress ) Doubly linked list count head rear 10 5 95 B F B F B F List B: Backward pointer F: Forward pointer Doubly Linked List Insertion: Follow the basic pattern. Need to connect both the forward and backward pointers. Each node with two pointer, one for predecessor, another for successor 0 1 20 pPre 20 pNew Before After Insert into null list or before first node 2 20 40 30 pNew 3 20 40 30 Before After Insert between two nodes count head rear list pSucc Algorithm insertDbl (ref list metadata, val dataIn dataType) If (full list) 1 return 0 End if Found = searchList (list, Pre, pSucc, dataIn.key) If (not found) 1 allocate (pNew) 2 pNew-data = dataIn 3 if (pPre is null) 1 pNew-back = null 2 pNew-fore = list.head 3 list.head = pNew 4 else 1 pNew-fore = pPre-fore 2 pNew-back = pPre 5 end if 6 if (pPre-fore null) 1 list.rear = pNew 7 else 1