dsa_hkc_docs/queue_8h_source.html

#ifndef QUEUE_H

#define QUEUE_H


#include <stdbool.h>


#define QUEUE_EMPTY (-1)


typedef struct node {

    int value;

    struct node *next;

} node_t;


typedef struct {

    node_t *head;

    node_t *tail;

} queue;


void init_queue(queue *q);


bool enqueue(queue *q, int value);


int dequeue(queue *q);


void printqueue(queue *q);


#endif // QUEUE_H

node_t
struct node node_t
A node in the singly linked list.

enqueue
bool enqueue(queue *q, int value)
Insert a new value at the end of the queue.
Definition queue.c:11

dequeue
int dequeue(queue *q)
Remove and return the value at the front of the queue.
Definition queue.c:26

node_t
struct node node_t
Node structure for the queue.

printqueue
void printqueue(queue *q)
Print the contents of the queue to stdout.
Definition queue.c:38

init_queue
void init_queue(queue *q)
Initialize a queue.
Definition queue.c:6

node
A node in the singly linked list.
Definition linkedlist.h:22

node::next
struct node * next
Pointer to the next node in the list.
Definition linkedlist.h:24

node::value
int value
The integer value stored in the node.
Definition linkedlist.h:23

queue
Queue structure.
Definition queue.h:36

queue::head
node_t * head
Pointer to the first node in the queue.
Definition queue.h:37

queue::tail
node_t * tail
Pointer to the last node in the queue.
Definition queue.h:38