//pqueue.inl
//methods for class PriorityQueue template

template <class Type>
void PriorityQueue<Type>::insert(Type p_data) {
	Node<Type> *np = firstnode();
	Node<Type> *nq = 0;

	while (np && p_data > np->getinfo()) {
		nq = np;
		np = np->getnext();
	}
	if (!nq)
		insertfront(p_data);
	else
		insertafter(p_data, nq);
}

template <class Type>
Type PriorityQueue<Type>::remove() {
	return removefront();
}