/**
 * ADT: QueueIdea
 * Description: The idea for a Queue structure
 * Notes:
 * 	1) Also see super-ADT
 * 	2) The (inherited) "add" method does an "enqueue"
 * 	3) The (inherited) "toNativeList" returns a list of elements in first to
 * 			last order (i.e., the order elements would be "dequeued")
 */
 
//Super (Parent) ADT: SpecializedStructureIdea (all methods in super are inherited by QueueIdea)

ADT: QueueIdea {
	

	/**
	 * Adds newElem to rear (end) of queue (as new last element)
	*/
	enqueue(newElem);


	/**
	/**
	 * Removes and returns front/first element
	 * Returns the removed element
	   If list is empty, throws exception:
			"(dequeue) Attempted to access element in empty list"
	 */
	dequeue();
	
	
	/**
	 * Returns front/first element
	 * Does NOT remove element
	 * If structure is empty, return null
	 */
	peek();
	
}