When programming Binary Trees in a high level programming language, we use an array of records.

Each record consists of the data and two pointers - A LEFT pointer and a RIGHT pointer.

Example :

Create a tree using the data Johnson, Clay, Mullet, Ferry, Zob, Lunt

Well, we already did that in the previous task.......

The data would be stored as...

The pointers give the node numbers of the left and right child nodes.