Abstract Data Types!
	Let's make one for a linked list
	It'll be the thing to use for lab 3

Features:
	access by index (with [], use reference)
	insert at any point
	delete any element
	push/pop in case we want a stack (use the front)
	Iterate through C++11 style 
		Reminder for me:  Iterator needs ++, !=, *() (return reference)
		Class needs begin and end
	<<, because it's irritating when collections don't have it
		
First:  Set it up with one type
Second:  Set it up as a template class

Alright, what's good and what's bad?
	Header files
	Runtime for print each item
	Individual allocation for each item

Anybody see anything else that would be good?