on which data structure elements are added and removed at same position
Answers
Answered by
0
A deque, also known as a double-ended queue. It has two ends, a front and a rear, and the items remain positioned in the collection. New items can be added at either the front or the rear. Likewise, existing items can be removed from either end.
Answered by
0
Explanation:
Double ended queue and two ended points
Similar questions