what data structure is insertion and deletion can take place at both ends is called as
Answers
Answered by
0
Explanation:
A stack is an ordered list in which all insertions and deletions are made at one end, called the top. A queue is an ordered list in which all insertions take place at one end, the rear, while all deletions take place at the other end, the front.
Answered by
4
Answer:
A dequeue is a linear data structure in which insertions and deletions can be done at both ends. (Some people pronounce it as “deck”.) The term dequeue comes from double ended queue.
Similar questions