//Tina Ostrander
//CSCI 143 -- Singly Linked Lists


//Queue implementation:  FIFO

public class Queue
{
	private List queue;

	public Queue()
	{
		queue = new List();
	}

	//Add data to the queue
	public void enqueue (int insertNum)
	{
		queue.insertAtBack (insertNum);
	}

	//Remove data from the queue
	public int dequeue()
	{
		return queue.removeFromFront();
	}

	//Determine whether stack is empty
	public boolean isEmpty()
	{
		return queue.isEmpty();
	}

	//Print the contents of the stack
	public void print()
	{
		queue.print();
	}
}
/*
queue - FIFO (first in first out)
stack  - LIFO	(last in first out)

 Stack	  Queue		  List
---------  -----------       ---------------------
								  insert
  push                  --> insertAtFront
            enqueue --> insertAtBack
  pop / dequeue --> removeFromFrom
								  removeFromBack
								  isEmpty
								  print
stack	(LIFO)								queue (FIFO)
5													5
3 5												5 3
9 3 5											5 3 9
2 9 3 5										5 3 9 2
9 3 5											3 9 2
3 5												9 2
5													2

*/