[Solved]Question 1 Queue Class Write Queue Class Using Doubly Linked Structure Implement Following Q37104591

QUESTION 1:

Queue Class: Write a Queue class using doubly-linked structureand implement the following functionalities.

enqueue (inserts element to the end)

dequeue (removes the front element and provides content)

isEmpty (checks whether the Queue is empty or not)

makeEmpty ()

peek (provides the element sitting at the top/front, but doesnot remove)

print (prints all the elements from front to the end)

reversePrint(prints all the elements from end to the front withthe help of back pointers inside your nodes)

Expert Answer

---

Answer to QUESTION 1: Queue Class: Write a Queue class using doubly-linked structure and implement the following functionalities. … . . .