Question d’entretien chez Nagarro
What would be time complexities if we insert at the head node and delete from the tail node?
Réponse à la question d'entretien
Utilisateur anonyme
12 sept. 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?
Utilisateur anonyme
For insertion, it's O(1), For deletion, it's O (n)