Implement Enqueue and Dequeue using a singly linked list in O(1) time.

Implement Enqueue and Dequeue using a singly linked list in O(1) time.

From the BUET MSC (ICT) May 2019 – Written exam, question 5 of 20.

More from this paper

Previous: Explain the Bellman-Ford algorithm for finding shortest paths in a graph with negative edge weights.
Next: Write assembly code for push and pop using the given instructions [MOV A, B; ADD A, B; ADD A, K].
All questions in BUET MSC (ICT) May 2019 – Written