Linked Lists - General Questions

In a circular singly linked list with a pointer to the last node, inserting at the front takes:

Which is a disadvantage of linked lists compared with arrays?

The advantage of a doubly linked list over a singly linked list is:

Deleting the last node of a singly linked list (with only a head pointer) takes:

Merging two sorted linked lists of lengths m and n takes: