Let us suppose the design of a module for managing linked lists with the following properties:

Double entry: a pointer on the "head" element and a pointer on the "tail" element

Bidirectionnal: each list element has a pointer towards its previous element and its next element.

What is complexity of the insertion algorithm, i$.$e$.$ adding an element either at the head or the tail of the linked list?