4 years ago
Lalit Bhagtani
0
Problem Statement Design a Queue (FIFO) data structure using Stack (LIFO). The Queue data structure will supports the following operations: enqueue(N) :- It insert element N to the back of the queue. dequeue() :- It removes and returns the element from the front of the queue. peek() :- It returns (not remove) the element from
Read More