Coding Exercises

Exercise $3.$

In this exercise, we revisit linked list implementation of queues. Efficiently implement a queue class using a singly linked list, with no header or tail nodes. Your implementation should contain functions isEmpty, enqueue, dequeue, and front. Give code in C$++$

$[10$ points$]$