in Dave's answers in the following link, He stated that a queue in sv is implemented as a linked list. hence, he said: "and requires a traversal of elements to get to element in between the head an tail."
in the SV LRM section 7.10 I found this sentence: "A queue supports constant-time access to all its elements as well as constant-time insertion and removal at the beginning or the end of the queue" which tells that a queue is more like an array, not a linked list because accessing any element in the queue consumes the same amount of time.
I got really confused now :(. can anyone explain?