Description

Please use the provided two files, main.c and function.h, to implement a queue. Includes following functions:

1. Enqueue: insert an element into a queue.
2. Dequeue: remove an element from a queue.
3. Print the first element: print the first element’s value inside a queue.
4. Print the last element: print the last element’s value inside a queue.
5. Check if it is empty: Check if a queue is empty.

Note that:

1. A Queue data structure shold follow FIFO(first in first out) rule.
2. The first element means the first insert element, and the last element means the latest insert element.
3. Print nothing if there is no first element and the last element.

Go download function.c, and only need to submit function.c.

Input

Legal commands:

1. “enqueue” with an integer N in a new line: Insert an element which value is N into the queue.
2. “dequeue”: remove the first element inside the queue and return its pointer. If the queue is empty return NULL.
3. “front”: peak the first element inside the queue and print its value. Print nothing if the queue is empty.
4. “back”: peak the last element inside the queue and print its value. Print nothing if the queue is empty.
5. “isempty?”: Check if the queue is empty, and print "Yes\n" or "No\n".
6. “debug”: You may use this to traversal your queue and check if it’s correct. Use it!!!

Output

No need to handle output. Please use function.c above.

Sample Input  Download

Sample Output  Download

Partial Judge Code

12920.c

Partial Judge Header

12920.h

Tags

Add Tag

Discuss