Question

i wanted to know about the implementation of queue using linked list.....

Answer 1

Any specific questions or you just want to know how to do it?

Answer 2

Here is a pretty straightforward explanation with example on C: http://www.cs.bu.edu/teaching/c/queue/linked-list/types.html

Answer 3

i have written a code on it could u plz find a mistake on that code it not giving output

Answer 4

sure, can you share the code?

Answer 5

this is the code @c0decracker

Answer 6

i made this on dev c++

Answer 7

In the constructor for the queue you have this:
```
queue()
{
front=new_node;
front->set_next(NULL);
rear = NULL;
size=0;
}
```

What do you think happens when you do `front=new_node` ?
new_node is just a pointer that hasn't been initialized at this point from what I understand, right?

Answer 8

yes

Answer 9

actually i wanted to do the coding of such kind of logic i am bit weak in pointers... @c0decracker

Answer 10

Ok so you do need to initialize that pointer before you use it, cause otherwise it points to a random block of memory. That's an issue.
Otherwise, I'll take a deeper look at this code tonight and get back to you with some thoughts.

Answer 11

okay thanks @c0decracker