I have a question about the queue implementation that was stated by leetcode. They're implentation used an array and used a circular techinque to solve it, but can't we use a linked list to implement a queue as well and it would give us the same flexiblity as the circular techinque shown. The reason I say that is because if a queue is a first in first out techinque then we can just call the head ot dequeu and when we want to enqueue we could just add it at the tail. Is my reasoning correct on this fact or am I just off the marker and leetcode is correct and that we normally use that circular array technique to implement a queue all the time.