This chapter covered the definition of LinkedList, double LinkedList, Tuples, Sets, Queues, and Stacks. The LinkedList methods – AddToHead, AddToEnd, LastNode, and iterateList—were also covered in this chapter. In addition, a priority queue was modeled as a heap of orders to be processed, sync queue was presented as passenger and ticket processing queues, and tuples were explained in a context in which a function returns a multivalued expression. The new, push, pop, and string methods for Stack were explained with code samples.
In the next chapter, we will cover areas such as the Trees, Tables, Containers, and Hash functions.
