Which of the following data structures allows to insert elements from one end and remove them from the same end?Group of answer choicesBoth Deque and StackDequeCircular QueueStack

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?a) Queueb) Circular queuec) Dequeued) Priority queue

Which data structure only allows removing data elements from front and inserting at rear?A ) QueuesB ) None of these answers are correctC ) Binary search treeD ) Linked ListsE ) Stacks

Which operation is used to insert an element at the rear end of a queue?Group of answer choicesEnqueueInsertAppendPush

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle:AQueueBCircular queueCDequeueDPriority queue

Which of the following methods inserts an element into a stack data structure? A. enqueue B. dequeue C. push D. pop E. peek