So does your 'struct entry' have a member called priority, which can take values represented by "lowest (L), low (l), normal (n), high (h), highest (H)" ?
More to the point, you've only shown the user interface.
The real meat of the problem is how implement the priority queue, of which there is very little to go on.
For example, if your queue has just one 'n' entry, and you try to add a 'H' entry, do you know how to do that?
