Pergunta de entrevista da empresa Nagarro
Can we perform insertion in O(1) time complexity?
Resposta da entrevista
Sigiloso
12 de set. de 2021
Yes. We need to maintain a pointer to the last node to keep O(1) efficiency for insertion.
Can we perform insertion in O(1) time complexity?
Sigiloso
Yes. We need to maintain a pointer to the last node to keep O(1) efficiency for insertion.