Node* p;
	p = new Node;
	p->firstname = firstName;
	p->lastname = lastName;
	p->value = value;

	if (rosterEmpty() == true)
	{
		head = p;
		tail = p;
		head->next = nullptr;
		p->prev = nullptr;
	}
	else {
		tail->next = p;
		p->prev = tail;
		tail = p;
		tail->next = nullptr;

	}