Stack:  First In, Last Out
Queuing : First In, First Out

Stacks and queues:
	Our linked list is already a stack
	But is it really the best way?
		Pointers, and content
		Linked data structures are more efficient with large items

Let's make a non-linked queue ADT that's stored on the heap
	And think about "enlarge"
	Should it have a fixed size option?
	We'll make it a template, to practice C++