linkedlist.h

template<class T>
	void LinkedList<T>::deleteElement(T currVal)
	{
		Node<T> *p = Head;
		//Stop at the node before the one you want to delete
		while (p->next->data != currVal)
		{
			p = p->next;
		}
		//set up the next node for deletion
		Node<T> *delptr = p->next;
		//reset pointers
		p->next = p->next->next;
		p = p->next;
		p->prev = p->prev->prev;
		//delete the node
		delete delptr;
	}

//helper function
template<class T>
	Node<T> *LinkedList<T>::getNode(T value) 
  {
		Node<T> *curr = Head;
		while (curr != nullptr) {
			if (curr->data == value)
				return curr;
			curr = curr->next;
		}
		return nullptr;
	}