Finishing out our queue:
	Making it expandable (do this first)
	Should it have a static size option?
	What if the user ignores it?
	Sort (there are better data structures if this will be frequent)
	
A copy constructor:
	It should make a deep copy of the queue
	If that was unwanted, a reference or pointer should have been used
		Having two objects that "own" data can be a problem
		Especially if they have properties that refer to said data

Alright...a function that can take either queue
	And is NOT a template function
	We can inherit from a base "generic_queue" type