Create a node class, followed by a queue class and create queue using the node class.

void enque (int x) //inserts x at the top of queue

int dequeue ( ) // removes top value from queue and returns the value being removed

int front ( ) // returns first value of the queue

int size ( ) // returns the size of queue

int min( ) //returns the minimum value of queue

int max( ) //returns the maximum value of queue

void display( ) //dispaly the queue