Domanda di colloquio di Nagarro
Can we perform insertion in O(1) time complexity?
Risposta di colloquio
Anonimo
12 set 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?
Anonimo
Yes. We need to maintain a pointer to the last node to keep O(1) efficiency for insertion.