How to implement Binary Tree search in Java?

Exercise $10\mathrm{.}1$ : Search $1$D Binary Tree Array

The $1D$ array arraybinary contains a binary tree with the root at index $=0$;

Write a while loop to search for the value in the variable thetarget

Write an if$-$else to change the variable index to search the left or right child

When the loop completes index must be the slot that equals variable thetarget

Do not declare the variable index, but do initialize and change it during the search.

Implement the instructions above by placing your Code here: