Queue with a single-linked list with a tail-up node

Package Db;public class Queue<e> {/** * Inner class--Single linked list * @author Fightzhao * * @param <E> */private static class Nod e<e> {public node<e> next;public e data;public Node (e data, node<e> next) {This.data = Data;this.next = Next;}} Private node<e> front;private node<e> rear;private int thesize;/** * enqueued * @param data */public void Enqueue (E  Data) {node<e> Pnode = new node<e> (data, NULL), if (rear! = null) {Rear.next = Pnode;rear = Pnode;} else {front = Rear = Pnode;} thesize++;} public int size () {return thesize;} /** * Out team * @return */public e dequeue () {e data = front.data;if (Front.next! = null) {front = Front.next;} else {front = R ear = null;} Thesize--;return data;} Public Queue () {front = Null;rear = null;} public void printall () {node<e> pnode= front;while (pnode!=null) {System.out.println (pnode.data);p node= Pnode.next;}}}

　　

Queue with a single-linked list with a tail-up node