template <typename T>
void DoubleLinkedList<T>::RemoveLast()
{
    Node<T> * travel = 0;
    Node<T> * trail = 0;
    if( m_head == 0 )
        cout << "The list is empty\n";
    else
    {
        travel = m_head;
        while (travel->GetNext() != 0)
        {
            trail = travel;
            travel = travel->GetNext();
        }
        trail->SetNext(0);
        delete travel;
    }
}