Data Structure & Algorithm

Queue:-queue is used in data structure to insert data at the end and remove at top. following are complete example of queue. public class Queue { int rear=-1; int front=-1; int size; int qArr[]; Queue (){ size=10; qArr=new int[size];  } Queue (int a){ size=a; qArr=new int[size];  } public boolean  isEmpty()                    { if(rear==front) return true; else return false;                  } public boolean isfull() { if(rear==size-1) return true; else return false;   } public void enqueue(int n) { if(isfull()) { System.out.println("Queue is full."); } else { if(front==-1) front++; rear++; qArr[rear]=n;        } } public int dequeue() {int temp=-9999; if(isEmpty()) { System.out.println("Stack is empty!"); } else { temp=qArr[fron...