Can you please give me this answer in java?
Develop an array implementation of a binary search tree using the computational strategy to locate the children of a node.
(2* n +1) for left child and 2 * (n + 1) for right child.
Note the binary search tree of integers will not be a true binary search tree as define in chapter 20(Binary Search Trees) of the text book.
The binaryArrayTree will support the following operations:
1. Default constructor
2. toString in level order
3. Insert(int item)