Establish a linked queue, and run operations in the linked queue. General operations include：Create queue, one element enqueue, one element dequeue, check if the queue is full. Implementation of algorithm Header file typedef int DataType; typedef struct Node { DataType data; struct Node *next; }Lnode; //define node type typedef struct Qu { Lnode *front; Lnode *rear; } Queue;//queue type Source file #include #include #include #include #include "queue.h" Queue * Initiate_queue()//Initial queue with head node, return pointer of the queue. { } int Queue_empty (Queue *queue)//Check if the queue if empty. If it is empty return 1 else return0. { } void En_queue(Queue *queue, DataType node)//Enqueue { } DataType De_queue(Queue *queue)//Dequeue a node, return its value. { Lnode *de_node; int seq; if(Queue_empty(queue)==1)//Check if the queue is empty { printf("The queue is empty! Cannot dequeue"); return -1; } else//dequeue an element { } } void displayQueue(Queue *queue)//Display the element in the queue { } void main()// { Queue *Q; int i; Q=Initiate_queue(); printf("Please input elements\n"); ______________;//generate the linked queue _______________;//display the elements in queue ______________;//dequeue an element _______________;//display the elements in queue _______________;//enqueue an element _______________;//display elements in queue }
- Establish a linked queue, and run operations in the linked queue.
General operations include：Create queue, one element enqueue, one element dequeue, check if the queue is full.
Implementation of
Header file
typedef int DataType;
typedef struct Node {
DataType data;
struct Node *next;
}Lnode; //define node type
typedef struct Qu
{
Lnode *front;
Lnode *rear;
} Queue;//queue type
Source file
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <malloc.h>
#include "queue.h"
Queue * Initiate_queue()//Initial queue with head node, return pointer of the queue.
{
}
int Queue_empty (Queue *queue)//Check if the queue if empty. If it is empty return 1 else return0.
{
}
void En_queue(Queue *queue, DataType node)//Enqueue
{
}
DataType De_queue(Queue *queue)//Dequeue a node, return its value.
{
Lnode *de_node;
int seq;
if(Queue_empty(queue)==1)//Check if the queue is empty
{
printf("The queue is empty! Cannot dequeue");
return -1;
}
else//dequeue an element
{
}
}
void displayQueue(Queue *queue)//Display the element in the queue
{
}
void main()//
{
Queue *Q;
int i;
Q=Initiate_queue();
printf("Please input elements\n");
______________;//generate the linked queue
_______________;//display the elements in queue
______________;//dequeue an element
_______________;//display the elements in queue
_______________;//enqueue an element
_______________;//display elements in queue
}
Step by step
Solved in 2 steps with 1 images
