Develop an array implementation of a binary search tree built upon an array based implementation of a binary tree using the simulated linked strategy. Each element of the array will need to maintain both a reference to the data element stored there and tje array position of the left and right child. You also need to maintain a list of available array positions where elements have been removed, in order to reuse thier position (Programming language Jave)