Computer scienceAlgorithms and data structuresData structuresLinear structures

Doubly linked list

Truth

Report a typo

Choose the correct statements about linked lists from the options below:

Select one or more options from the list

The complexity of adding an element before a specified node (to which we have a reference) in a doubly linked list is equal to

O(n)

The complexity of adding an element before a specified node (to which we have a reference) in a singly linked list is equal to

O(n)

The complexity of adding an element before a specified node (to which we have a reference) in a doubly linked list is equal to

O(1)

The complexity of adding an element before a specified node (to which we have a reference) in a singly linked list is equal to

O(1)

Create a free account to access the full topic