Linked List ( Return first element in a queue)

"Hello C world",

I am trying to write a function to return the first element of a link list queue. I am not real sure how to implement this. I have include a copy of the struct for my Node & queue. Thanks in advance for the help.

-DeeMan

Code:

typedef struct event_Node {
    void *data;
    double arri_time;
    double serv_time;
    double depart_time;
    double start_o_serv;
    double wait_time;
    bool arri_flag;
    bool depart_flag;
    bool wait_flag;
    bool being_serv_flag;
    struct _QueueNode *link;
} event_Node;

typedef struct _Queue {
    int size;
    QueueNode *head;
    QueueNode *tail;
} Queue;

void *queue_front(Queue *q)
{
    //return q->size ? 
    q->head->data : NULL;// this is where I am stuck
}

Well, you don't seem like you've done anything. You declare a structure but don't ever seem to initialize it.

So you seem to be going for a head and tail linked list, which is fine. So, you write a function that malloc's the structure out and you make the first element the head and the last one the tail. For one element, these are the same. By head and tail, those would just be pointers to the front and back of the list.

Also, with the way you wrote it, it seems like the queue structure should have the event_Node structure in it and not the other way around. What are you trying to make here?

Have you ever seen an implementation of a linked list? Here is the first one I saw and loved. Read the comments and get into the spirit. Then try to code.

Thank you std10093 and MutantJohn,

I made those changes MutantJohn, but I also need to look through the link that std10093 sent me to. It was very helpful and I learned a lot from that. I am still looking at the code on his site so that I can get a better understanding. std10093 that was brilliant. Thanks again

-DeeMan

I had that help when I came across lists for my first time, so I think it would be great if more people could have that chance too! You are welcome