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
In which data structure are elements inserted at one end and deleted from the other end?
Share
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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
The 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.