Queue Skeleton

gistfile1.txt

package edu.au.scitech.sc2101;

import edu.au.scitech.sc2101.IntegerLinkedList.Node;

public class Queue extends IntegerLinkedList {
	Node tail;
	
	
	@Override	
	public void add(int newValue) {
		// add to the end of the list
		// utilise tail pointer
		
		Node n = new Node(newValue);
		if (head == null) {
			// new list, just update head
			head = n;
			tail = head;
		} else {
			tail.next = n;
			tail = n;
		}
	}
	
	public void enqueue(int value) {
		add(value);
	}
	
	public int dequeue() {
		int value = getNode(0).value;
		delete(0);
		return value;
	}

}