4.2 Data Types

The types for memory allocation and managing data as void * pointers were discussed previously (see The Table ADT), but to build a table implementation using BSTs we must define some additional types. In particular, we need struct bst_node to represent an individual node and struct bst_table to represent an entire table. The following sections take care of this.

Subsections:

• 4.2.1 Node Structure
• 4.2.2 Tree Structure
• 4.2.3 Maximum Height

4.1.1 Aside: Differing Definitions

4 Binary Search Trees

4.2.1 Node Structure