In which data structure are elements inserted at one end and deleted from the other end? a) Stack
b) Queue
c) Array
d) Linked List
Question & Answer
In which data structure are elements inserted at one end and deleted from the other end?
1 Answer
Verified archiveThe correct answer is b) Queue.
A queue is a data structure that follows the First In First Out (FIFO) principle, meaning that elements are added (enqueued) at one end (the back) and removed (dequeued) from the other end (the front). This structure is useful for scenarios where order needs to be preserved, such as in scheduling tasks or managing resources.