Node* q = m_head;
	while (q != nullptr)
	{
		if (q->m_prev == nullptr && p->m_stringl < q->m_stringl)
		{
			p->m_next = q;
			p->m_prev = nullptr;
			q->m_prev = p;
			m_head = p;
		}
		if (q->m_next == nullptr && p->m_stringl > q->m_stringl)
		{
			p->m_next = nullptr;
			p->m_prev = q;
			q->m_next = p;
			m_tail = p;
		}
		if (lastName == q->m_stringl)
		{
			if (q->m_prev == nullptr && p->m_stringf < q->m_stringf)			//checks for first and last node
			{
				p->m_next = q;
				p->m_prev = nullptr;
				q->m_prev = p;
				m_head = p;
			}
			if (q->m_next == nullptr && p->m_stringf > q->m_stringf)
			{
				p->m_next = nullptr;
				p->m_prev = q;
				q->m_next = p;
				m_tail = p;
			}
			std::cout << q->m_stringl;
			std::cout << p->m_stringl;
			std::cout << m_size;
			if (firstName > q->m_stringf)
			{
				std::cout << q->m_stringl;
				std::cout << p->m_stringl;
				std::cout << m_size;
				p->m_next = q->m_next;
				p->m_prev = q;
				q->m_next->m_prev = p;
				q->m_next = p;
			}
			if (firstName < q->m_stringf)
			{
				std::cout << q->m_stringl;
				std::cout << p->m_stringl;
				std::cout << m_size;
				p->m_next = q;
				p->m_prev = q->m_prev;
				q->m_prev->m_next = p;
				q->m_prev = p;
			}
		}
		if (q->m_prev->m_stringl < p->m_stringl && q->m_stringl > p->m_stringl)
		{
			std::cout << q->m_stringl;
			std::cout << p->m_stringl;
			std::cout << m_size;
			p->m_next = q;
			p->m_prev = q->m_prev;
			q->m_prev->m_next = p;
			q->m_prev = p;
		}
		q = q->m_next;
	}
	m_size++;
	return true;
}