Chapter 11. Storage Structures

IN THIS CHAPTER

• Arrays

• Linked Lists

• HashTables

• Binary Trees

• Red/Black Trees

Previous chapters discussed how to set up efficient structures for storing pieces of related data and the different techniques used for sorting data efficiently. This chapter discusses how you can manage collections of data structures. It looks at the performance and footprint characteristics of several structuring techniques and gives examples of when and how to use each structure. Ready-to-use implementations are added.