Question

Data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is

Answer 1

Answer:

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is? Explanation: In dequeuer, we can insert or delete elements from both the ends. In queue, we will follow first in first out principle for insertion and deletion of elements.

Dequeue (Doubly Ended Queue)

In a Double Ended Queue, insertion and deletion operations can be done at both FRONT and END of the queue

Answer 2

A Data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

Answer:

Dequeue

Explanation:

deque, also known as a double-ended queue, is an ordered collection of items similar to the queue. It has two ends, a front and a rear, and the items remain positioned in the collection. ... In a sense, this hybrid linear structure provides all the capabilities of stacks and queues in a single data structure.

what is the return type of function id()!!

Answer :int

explanation : execute help id()to find out default in python shell. id returns a integer value that is unique..

hope it helps you