Examples with BinaryTreeInOrder com.github.pedrovgs.problem15.BinaryTreeInOrder used on opensource projects

Example 1 with BinaryTreeInOrder

use of com.github.pedrovgs.problem15.BinaryTreeInOrder in project Algorithms by pedrovgs.

the class SortedArrayToBSTTest method shouldReturnOneBinarySearchTree.

/**
   * If you get an in order traversal of a BST you get a sorted collection of elements. We are
   * going to use this property to assert the result.
   */
@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);
}