void pop_front(const T& t)
	{
		// Deallocate memory pointed to by head
		node<T>* tempNode = head;
		delete head;
 
		// Get new head
		head = tempNode->next;
	}
 
	void pop_back(const T& t)
	{
		// Deallocate memory pointed to by tail
		delete tail;
 
		// Get new tail
		node<T>* currentNode = head;
		for (size_t i=0; i<sizet-2; i++)
		{
			currentNode = currentNode->next;
		}
		tail = currentNode;
		tail->next = NULL;
	}

void pop_front(const T& t)
{
    if( head != NULL)
    {
        node<T>* tempNode = head;
 
        // Get new head
        head = tempNode->next;
        // OR just this
        head = head->next;
 
        // Deallocate memory pointed to by head
        delete tempNode;
    }
}

void pop_back(const T& t)
{
    // Deallocate memory pointed to by tail
    delete tail;
    tail = NULL;
    // Get new tail
    node<T>* currentNode = head;
    while(currentNode->next != NULL)
    {
             tail = currentNode;
             currentNode = currentNove->next;	
    }
    if( currentNode == head)
    {
          head = tail = NULL;
    }
}