The Bounded Deque
As the reader may remember from Chapter 9, a deque is a double-ended queue permitting insertion and removal of items at either the front or the back of the structure. Chapter 14 presents the bounded form of deque — a data structure having many similarities with the bounded queue discussed in Chapter 10.
KeywordsBounded Form Loop Index Abstract Data Type Additional Constructor Additional Selector
Unable to display preview. Download preview PDF.