which among array, linked list, and vector is easy and more preferred implementation o queue
Which implementation is easy and more prefered
Hey In queue we push at end and pop from start
So considering these two the most optimal underlying Data structure will be Singly Linked list
Where we can delete at head and insert at tail.
In vector or array either it will take more time to do so in shifting or it will take more space if you make it time efficient .