A simple data structure, in which insertion and deletion occur at the same end, is called
Answers
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. Element with least priority will be deleted in a priority queue.
Answer:- A simple structure, in which insertion and deletion of the items occur at the same end is called top of the stack. Stack is the simple data structure.
A stack is a basic data structure which can be thought as a linear structure, which is represented by a real physical stack or the pile.
In stack, a simple data structure, in which insertion and deletion of any item occur at the same end is called the top of the stack.
For an example you can take the stack of plates or the stack of books in which you can only add or take the first plate or book, i.e., the insertion or deletion of the book or plate is done on the same end, i.e., from the top.
So, your answer is that the simple data structure is the stack.
To know more about the given topic please go through the following
Link1:- https://brainly.in/question/4617854?
Link2:- https://brainly.in/question/20225642?
#SPJ6