. Previously we discussed how a linked list could be stored in an array of nodes using the

index values as pointers and managing our list of free nodes. We can use the same

techniques to store the nodes of a binary search tree in an array, rather than using dynamic

storage allocation. Free space is linked through the left member.