Chapter 3, Problem 9C

Explanation of Solution

Algorithm:

//Input: two doubly linked lists L and M

//Output: the concatenated list L’ of L and M

Algorithm ConcatenateDoublyLinkedList(L, M)

{

DoublyNode V = (L.getTrailer()).getPrev()

DoublyNode x = (M.getHeader()).getNext()

(M.getHeader()).setNext(null)

(L.getTrailer()).setPrev(null)

v.setNext(x)

x.setPrev(v)

L’ = L

L’.setTrailer(M.getTrailer())

return L’

}

Explanation:

The above is an algorithm for concatenating two doubly linked lists L and M, with header and trailer sentinel nodes, into a single list L ′...