Implementation of the queue of data structures (JAVA)

Stackelement see the implementation of the stack

Package Com.lip.datastruture.stack;public class Queue<t>{private stackelement<t> obj;//save Data Private int size;//number of elements public Queue () {this.size = 0;} Into the queue public boolean enQueue (T data) {if (data! = NULL) {stackelement<t> tempelement = obj;if (obj! = null) {while (obj . getnextelement () = null) {obj = Obj.getnextelement ();} obj. setnextelement (new stackelement<t> (data)); obj=tempelement;} else obj=new stackelement<t> (data); This.size++;return true;} return false;} Out of Queue public boolean deQueue () {if (This.size > 0) {this.obj = This.obj.getNextElement (); This.size--;return true;} return false;} The element that gets the first into the queue public T GetFirst () {if (obj! = null) return Obj.getdata (); return null;} Get the last element into the queue public T getlast () {stackelement<t> tempelement = obj;if (tempelement! = null) {while ( Tempelement.getnextelement ()! = null) {tempelement = Tempelement.getnextelement ();} return Tempelement.getdata ();} return null;} public int size () {return this.size;} public static void Main(string[] args) {queue<integer> Queue = new queue<integer> (); for (int i = 0; i <; i++) {queue.enqueue (i);} System.out.println ("First:" + Queue.getfirst ()); System.out.println ("Last:" + queue.getlast ()); System.out.println ("Size" + queue.size ()); for (int i = 0; i <; i++) {System.out.println (Queue.getfirst ()); Queue.dequeue ();}}}

Operation Result:

Implementation of the queue of data structures (JAVA)