Computer scienceAlgorithms and Data StructuresData structuresLinear structures

Singly linked list

Theory

Operation complexity

Report a typo

A singly linked list can support removing the tail operation. It needs modification of the next reference of the second to last node.

Suppose you have a reference to the tail. How does the execution time of this operation depend on the size of the list?

Select one option from the list
___

Create a free account to access the full topic