is queue an ADT or a data structure

A queue is both an Abstract Data Type ( AD T ) and a data structure . \n \n As an AD T , a queue describes a set of operations that can be performed on a collection of elements , such as adding an element to the back of the queue , removing an element from the front of the queue , and checking the size of the queue . \n \n As a data structure , a queue is an implementation of the queue AD T using a particular set of programming construct s , such as arrays or linked lists . A queue data structure typically stores a collection of elements in a way that pres erves their order , with new elements added to the back of the queue and removed from the front of the queue in a first - in , first - out ( FI FO ) manner . </s>