GNU libavl 2.0.1
Author: Ben Pfaff

2 The Table ADT |

Most of the chapters in this book implement a table structure as some kind of binary tree, so it is important to understand what a table is before we begin. That is this chapter's purpose.

This chapter begins with a brief definition of the meaning of "table" for the purposes of this book, then moves on to describe in a more formal way the interface of a table used by all of the tables in this book. The next chapter motivates the basic idea of a binary tree starting from simple, everyday concepts. Experienced programmers may skip these chapters after skimming through the definitions below.

Sections:

- 2.1 Informal Definition
- 2.2 Identifiers
- 2.3 Comparison Function
- 2.4 Item and Copy Functions
- 2.5 Memory Allocation
- 2.6 Creation and Destruction
- 2.7 Count
- 2.8 Insertion and Deletion
- 2.9 Assertions
- 2.10 Traversers
  - 2.10.1 Constructors
  - 2.10.2 Manipulators
- 2.11 Table Headers
- 2.12 Additional Exercises

1.4 License | Table of Contents | 2.1 Informal Definition