HELP IN JAVA:

Create a binary search tree with a two-dimensional array.

Use input 17 81 21 13 7 15 49 12 23 48.

You can hard code the input you cannot hard code left child and right child you need to find it with a method.

Output the entire array with item, left child, right child.