32 queue -> front = NULL;
43 if (queue->
front == NULL)
57 struct Node *newNode = (
struct Node *)malloc(
sizeof(
struct Node));
59 newNode ->
next = NULL;
62 queue -> front = newNode;
63 queue -> rear = newNode;
66 queue -> rear ->
next = newNode;
67 queue -> rear = newNode;
84 printf(
"Empty Queue\n");
89 delNode = queue -> front;
90 popdata = delNode ->
data;
91 queue -> front = queue -> front ->
next;
void initQueue(struct Queue *queue)
Initialize queue structure with NULL value.
int isEmpty(struct Queue *queue)
Check if queue structure is empty.
int dequeue(struct Queue *queue)
Take out the first added element.
void enqueue(struct Queue *queue, int data)
Allocate new node and add to queue structure.
Node data structure contains data and next node pointer.