Implementation of Queue

Before starting coding, write the operations of queue

enQueue$()$ This operation adds a new node after rear and moves rear to the next node.

deQueue$()$ This operation removes the front node and moves front to the next node.

isEmpty$()$: Check queue is empty or not

display$()$: Print all element of Queue.

Exercise#$1$

Write a program to demonstrate the array implementation of Queue.

Exercise#$2$

Write a program to demonstrate the linked list implementation of Queue. java program, shoecthe output