Domanda di colloquio di Nagarro
What would be time complexities if we insert at the head node and delete from the tail node?
Risposta di colloquio
Anonimo
12 set 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?
Anonimo
For insertion, it's O(1), For deletion, it's O (n)