Java implementation chain queue

Java implements the class code for the chain queue:

Package Linkqueue;public class Linkqueue {class Element{object elem; Element Next;} Private element Front;private element rear;private Element Header = null;/** * Initialize queue * */void initqueue () {header = new Ele ment (); front = new element (); rear = new Element (); front=header;rear=header;} /** * Insert element into queue * */void enQueue (Object o) {element e=new element (); E.elem=o;if (Rear==header)//Insert element for first time {Rear=e;header.next =e;front.next=e;} Else{rear.next=e;rear=e;}} /** * Out team * */object DeQueue () {Object o = null;if (rear==header) {System.out.println ("queue is empty! ");} Else{o=front.next.elem;if (Front.next==rear)//team has only one element {Front.next=header;rear=header;} More than one element in the else//team {Front.next=front.next.next;}} return o;} /** * print queue * */void print () {System.out.print ("Print queue:"); Element temp = front;while (temp!=rear) {System.out.print (temp.next.elem+ "\ t"); temp=temp.next;} System.out.println ();}}

Test Class Code:

Package Linkqueue;public class Linkqueuemain {public static void main (string[] args) {linkqueue lqueue = new Linkqueue (); l Queue.initqueue (); SYSTEM.OUT.PRINTLN ("Team Operation:" +lqueue.dequeue ()); Lqueue.enqueue (1); Lqueue.enqueue (2); Lqueue.enqueue (3); Lqueue.enqueue (4); Lqueue.enqueue (5); Lqueue.print (); SYSTEM.OUT.PRINTLN ("Team Operation:" +lqueue.dequeue ()); SYSTEM.OUT.PRINTLN ("Team Operation:" +lqueue.dequeue ()); Lqueue.print (); SYSTEM.OUT.PRINTLN ("Team Operation:" +lqueue.dequeue ()); SYSTEM.OUT.PRINTLN ("Team Operation:" +lqueue.dequeue ()); Lqueue.print (); SYSTEM.OUT.PRINTLN ("Team Operation:" +lqueue.dequeue ()); SYSTEM.OUT.PRINTLN ("Team Operation:" +lqueue.dequeue ()); Lqueue.print ();}}

　　

Java implementation chain queue