What Will This Appendix Teach Me?
We begin by discussing flat files and some of the problems that can occur when such files need to be processed in different orders. Then, we turn to three specialized data structures: sequential lists, linked lists, and indexes (or inverted lists). Next, we illustrate how each of three special structures—trees, sim-ple networks, and complex networks—are represented using various data structures. Finally, we explore how to represent and process multiple keys.