June 2016
Intermediate to advanced
1168 pages
38h 16m
English
IN THIS SECTION, WE introduce two closely related data types for manipulating arbitrarily large collections of objects: the stack and the queue. Stacks and queues are special cases of the idea of a collection. We refer to the objects in a collection as items. A collection is characterized by four operations: create the collection, insert an item, remove an item, and test whether the collection is empty.
4.3.1 Stack of strings (array)
4.3.2 Stack of strings (linked list)
4.3.3 Stack of strings (resizing array)
4.3.6 Generic FIFO queue (linked list)
4.3.8 Load balancing simulation
Programs in this section
When we insert an item into a collection, ...
Read now
Unlock full access