Implement Queue data structure using Linked List.
Each node of a queue
has a data and pointer to a next node. Then methods of the queue:
- Enqueue - add to a queue - is an appending to a Linked List
- Dequeue - remove from queue - removing a head of a Linked List
This implementation represents a template class
that allows to create a queue of nodes of any type.
make
helps generate main and test binaries to run tests or interactive main program.
make build
make run
make test
make clean