Chapter 8

Storing Binary Trees

Such trees normally are stored in memory using a linked structure similar to that of linked lists.

each entry(or node) of the binary tree contains three components:

1.the data

2.a pointer to the node's first chuld

3.a pointer to the node's second child

NIL:NIL is merely a special bit pattern placed in the pointer cell of the last entry to indicate that no further entries are in the list


Customized Data Types

a user-defined data type is essentially a template that is ussed in constructing instances of the types. it describes the properties that all instances of that type have but does not itself constitute an occurrence of that type.  

a complete data type consists of two parts:

1.a predetermined storage system

2.a collection of predefined operations