while(temp)
{
if (!new_list)
{
new_list = new node;
last = new_list;
last -> previous = NULL;
}
else
{
last -> next = new node;
(last -> next) -> previous = last;
last = last -> next;
}
last -> info = temp -> info;
last -> next = NULL;
temp = temp -> next;
}
return new_list;
}
// Delete a linked list, the same as singly linked list.
void destroy(Double_list & a_list)
{
node * garbage = a_list;