@Test public void shouldReturnOneBinarySearchTree() {

  Integer[] array = { 1, 2, 3, 4, 5, 6, 7, 8 };
  BinaryNode<Integer> result = sortedArrayToBST.transform(array);
  BinaryTreeInOrder inOrder = new BinaryTreeInOrder();
  List<BinaryNode<Integer>> resultList = inOrder.getIterative(result);
  Integer[] resultArray = new Integer[resultList.size()];
  for (int i = 0; i < resultList.size(); i++) {
    resultArray[i] = resultList.get(i).getData();
  }
  assertArrayEquals(array, resultArray);
}