UCFD_SPARSE  v1.0
Documentation
Loading...
Searching...
No Matches
queue.h
Go to the documentation of this file.
1#ifndef QUEUE_H
2#define QUEUE_H
3
7struct Node {
8 int data;
9 struct Node *next;
10};
11
12
16struct Queue {
17 struct Node *front;
18 struct Node *rear;
19};
20
21void initQueue(struct Queue *queue);
22
23int isEmpty(struct Queue *queue);
24
25void enqueue(struct Queue *queue, int data);
26
27int dequeue(struct Queue *queue);
28
29
30#endif
void initQueue(struct Queue *queue)
Initialize queue structure with NULL value.
Definition: queue.c:30
int isEmpty(struct Queue *queue)
Check if queue structure is empty.
Definition: queue.c:41
int dequeue(struct Queue *queue)
Take out the first added element.
Definition: queue.c:77
void enqueue(struct Queue *queue, int data)
Allocate new node and add to queue structure.
Definition: queue.c:55
Node data structure contains data and next node pointer.
Definition: queue.h:7
int data
Definition: queue.h:8
struct Node * next
Definition: queue.h:9
Queue data structure.
Definition: queue.h:16
struct Node * rear
Definition: queue.h:18
struct Node * front
Definition: queue.h:17