class Queue { private: linked_list l; public: bool isEmpty() { return (l.isEmpty()); } void enQueue (int value) { l.insert_end(value); } int deQueue() { if(isEmpty()) { cout<<"\nQueue is Empty\t"; return 0; } int x=l.start()->info; l.delete_beg(); return x; } };