/************************* * Written By: bornToCode() ************************** Just more data structures practice... A generic linked queue. */ public class Node> { public T data; public Node next; public Node(T data) { this.data = data; next = null; } public Node(T data, Node next) { this.data = data; this.next = next; } } public class LinkedQueue> { private Node head; private Node tail; private int count; public LinkedQueue() { head = null; tail = null; count = 0; } public void clear() { while(!isEmpty()) { dequeue(); } head = tail = null; } public final int size() { return count; } public final boolean isFull() { return false; } public final boolean isEmpty() { return count == 0; } public void enqueue(T data) { if(isEmpty()) { head = new Node(data); } else if(count == 1) { tail = new Node(data); head.next = tail; } else { Node newNode = new Node(data); tail.next = newNode; newNode = tail; } count++; } public T dequeue() { if(isEmpty()) { return null; } else { T toDequeue = head.data; head = head.next; count--; return toDequeue; } } } public class Program { public static void main(String[] args) { LinkedQueue queue = new LinkedQueue(); queue.enqueue(1); queue.enqueue(2); queue.enqueue(3); System.out.println(queue.dequeue()); System.out.println(queue.dequeue()); System.out.println(queue.dequeue()); LinkedQueue queue2 = new LinkedQueue(); queue2.enqueue("first"); queue2.enqueue("second"); queue2.enqueue("last"); System.out.println(queue2.dequeue()); System.out.println(queue2.dequeue()); System.out.println(queue2.dequeue()); } }