The following algorithms are for the operations of a doubly linked list, L$.$ It is assumed that the list has $2$

attributes, head and tail referencing the first and last node respectively. A node of the list is assumed to

have $3$ attributes, info, next and prev referencing the data item in the node, the next node and previous

node respectively.