1/**
 2 * A struct that represents a single node in a linked list
 3 */
 4struct node {
 5  int priority;
 6  int data;
 7  struct node *next;
 8};
 9
10typedef struct node Node;
11
12/**
13 * A struct that represents a Queue implemented using a Singly Linked List.
14 */
15typedef struct {
16  Node *head;
17  int size;
18} PriorityQueue;
19
20PriorityQueue *initialize(void);
21int size(PriorityQueue *queue);
22void add(PriorityQueue *queue, int priority, int data);
23int delete_min(PriorityQueue *queue);
24void destroy(PriorityQueue *queue);
25void inspect(PriorityQueue *queue);