This textbook covers the material recommended by the ACM for a second course in computer science. It covers the definitions, concepts, and algorithms expected in a data structures text. The prerequisite is an introductory course in the Pascal programming language.

The book contains meaningful, real-life examples. The more difficult examples are developed first in pseudocode, then in Pascal code.

The contents cover linked lists, stacks, queues, searching, sorting, recursion, binary trees, hashing, and implementing graphs in Pascal.

The Pascal code used in the text is standard Pascal.