Pergunta de entrevista da empresa Nagarro
What would be time complexities if we insert at the head node and delete from the tail node?
Resposta da entrevista
Sigiloso
12 de set. de 2021
For insertion, it's O(1), For deletion, it's O (n)
What would be time complexities if we insert at the head node and delete from the tail node?
Sigiloso
For insertion, it's O(1), For deletion, it's O (n)