COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
which data structure type allows deleting data elements from front and inserting at rear?
|
|
Stacks
|
|
|
Queues
|
|
|
Dequeue
|
|
|
Binary search tree
|
Explanation:
Detailed explanation-1: -Queue allows insertion of data elements from rear and deletion from front.
Detailed explanation-2: -It is a FIFO (First In First Out) data structure, which means that we can insert an item to the rear end of the queue and remove from the front of the queue only.
Detailed explanation-3: -A dequeue in data structure is a linear data structure, which stands for Double Ended Queue. In a deque, the data can be inserted and deleted from both front and rear ends.
Detailed explanation-4: -Dequeue is a data structure in which we can add and remove items from both the front and rear ends.
There is 1 question to complete.