Pergunta de entrevista da empresa Nagarro
What is the time complexity for insertion and deletion?
Resposta da entrevista
Sigiloso
12 de set. de 2021
For insertion, it's O(n), For deletion, it's O(1)
What is the time complexity for insertion and deletion?
Sigiloso
For insertion, it's O(n), For deletion, it's O(1)