Create the ADT for a binary search tree using the array implementation. In an array implementation, the pointers become indexes to the sub tree elements. When you create the tree, you need to know the maximum number of nodes to be stored in the tree.