/* lqueue.c */

/* fill in the functions below. the main program in lqmain.c should
   work as expected, shown in pic1.pdf */

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

#include "lqueue.h"

/* create and return an empty q */
Queue *qCreate() {
}

/* destroys the q */
void qDestroy(Queue * qh) {
}

/* print all values in the q in the order in which they appear  */
void qPrint(Queue * qh) {
}

/* create a new node with value=key and insert it in the queue */
void qEnq(Queue * qh, int key) {
}

/* return the head */
Node *qHead(Queue * qh) {
}


/*  delete the node from the queue */
void qDelete(Queue * qh, Node *node) {
}