The basic linked list implementation uses a singly-linked list with a tail pointer to keep track of the back of the queue. So the previous tail is considered next compared to the item being added and ...The basic linked list implementation uses a singly-linked list with a tail pointer to keep track of the back of the queue. So the previous tail is considered next compared to the item being added and the tail pointer points to the new item. The front item on the queue is just the one referred to by the linked list's head pointer The performance of getSize() depends on the performance of the corresponding operation in the linked list implementation.
