Link Based Queue Problem:

Create a node class/struct. Create a queue class/struct. Members: Node - a node that tracks the front of the queue. Node - a node that tracks the end of the queue. Count - indicates how many items are on the queue. Methods: En-queue - Accepts a number and adds to the end of the queue. De-queue - Returns a number from the front of the queue. - If the queueis empty, emit an error indicating the queueis empty. IsEmpty - Returns a boolean indicating if the queue is empty.