Simplistic ADT queue implementation using provided issue - c

Question

/****************************************************************************/
/* File: queue.h
*/
/****************************************************************************/
/****************************************************************************/
/* */
/* Simple Queue ADT */
/* */
/* Declaration */
/* */
/****************************************************************************/
typedef struct {
int key;
int value;
} data_t;
typedef struct queueNode {
struct queueNode *next, *prev;
data_t *data;
} QueueNode;
typedef struct queueType {
QueueNode *head;
QueueNode *tail;
} Queue;
/********************************************************************
Alright, so above I have a file provided for me called Queue.h, this makes sense to me in some respect as it gives data_t a pair of values (value and key) and stores that in a QueueNode, which is placed in either the Tail or Head of a queue.
The problem I'm having is that I DO NOT KNOW how to use this to create a Class called Queue.c that does the following functions:
voidinitQueue(Queue *self){
}
void enQueue(Queue *self, data_t *data){
}
QueueNode *frontNode(Queue *self){
}
data_t *frontValue(Queue *self){
}
data_t *dequeue(Queue *self){
}
void removeNode(queue *self, queueNode *p){
}
QueueNode *findNode(queue *self, data_t *data){
}
void printQ(queue *self, char *label){
}
With this (not meant to be altered) main():
/*
int main ()
{
Queue myQueue;
QueueNode *p;
data_t data[10], d2;
int i;
initQueue (&myQueue);
for (i = 0; i < 10; i++) {
data[i].key = i;
data[i].value = 10*i;
enQueue (&myQueue, &data[i]);
}
printQ (&myQueue, "MyQueue:" );
}
*/
Now I'm not going to ask anyone to do this for me, that doesn't help me at all in the long run, but I have absolutely no idea what to do.
I have a basic understanding of how a queue works, my problem is how to execute it. I'm also learning java in another class right now and it's begun to confuse me what rule apply to what class (as in school class, not java class)
If someone could walk me through how one's meant to work with a few of these (or at least initQueue) I'd be really grateful, Ive been working on this for 12 hours now and I'm getting desperate....
Edit:
Update: This is what i have now:
void initQueue(Queue *self)
{
self->head = NULL;
self->tail = NULL;
}
void enQueue(Queue *self, data_t *data)
{
self->head = data;
}