LinkedList.cpp

template<typename T>
LinkedList<T>::LinkedList() 
{
  head = new node;
	tail = new node;
	
	head->prev = 0; //This can also be null, same thing.
	head->next = tail;
	
	tail->next = 0;
	tail->prev = head;
	
	// From here on out, you keep everything in between head and tail, 
	// and never change what head and tail point to. This is useful for
	// iterating, as you can check when you've reached the beginning / 
	// end of the list, because you always know where those places are!
	//  (head and tail, respectively)
	
	
	current = NULL;
}