Question: public class MyQueue { private Node front; private Node back; private int size; class Node { private T value; private Node next; public Node(T s){

public class MyQueue{ private Nodefront; private Node back; private int size; class Node { private T value; private Node next; public Node(T s){ value=s; next=null; } public Node(T s,Node n){ value=s; next=n; } public void setValue(T s){ value=s;} public T getValue(){return value;} public void setNext(Node s){ next=s;} public Node getNext(){return next;} } void enqueue(T s){ if(isEmpty()){ front=new Node(s); back=front; size++; } else { Node n=new Node(s); back.setNext(n); back=n; size++; } } T dequeue(){ T s=(T) front.getValue(); Node t=front; //front.getNaext(); front=front.getNext(); //front.setNext(null); t.setNext(null); //front=t; size--; return s; } int getSize(){return size;} boolean isEmpty(){return (size==0);} public static void main(String arg[]){ MyQueue q=new MyQueue(); q.enqueue("1"); q.enqueue("2"); q.enqueue("3"); while(!q.isEmpty()){ System.out.println(q.dequeue()); } } } 

what is this code for, is it for queue or generics plus provide be question for me so can solve it on my own because I have a quiz TOMORROW

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!