Are there easy and efficient method to construct a binary tree without using structures or pointers?

How can we use STL to construct a binary search tree, as suppose we have given an array with n numbers, where n is about 10000, just example, so how can we construct a binary search tree without using pointers or structures to find a number…?