Description
There's a dequeue already define in "function.h" and stack , queue inherit from the _dequeue.
Please implement those function below:
stack::
void push(const _node N);
void pop();
_node* get_data();
queue::
void push(const _node N);
void pop();
_node* get_data();
Good luck.
Stack
A stack is an abstract data type that serves as a collection of elements, where a node can be added to a stack and removed from a stack only at its top. Two principal operations can be used to manipulate a stack: push, which adds an element at the top, and pop, which removes the element at the top of the collection.
Queue
A queue is an abstract data type that serves as a collection of elements, where nodes are removed only from the head of the queue and are inserted only at the tail of the queue. Two principal operations can be used to manipulate a queue: enqueue, which inserts an element at the tail, and dequeue, which removes the element at the head of the collection.
Input
There will be few instruction in input [cont] [inst] [data].
cont and inst will be string
cont will be "stack" or "queue"
inst will be "push", "pop", "front" for queue only and "top" for stack only.
data will be optional (only when push inst , it will give the data ")
"exit" means exit
Output
In every "get_data"(top or front) commands , it will be single line with the data.