package com.fishercoder;

import com.fishercoder.common.utils.TreeUtils;
import com.fishercoder.solutions._108;
import org.junit.BeforeClass;
import org.junit.Test;

public class _108Test {
    private static _108.Solution1 solution1;
    private static int[] nums;

    @BeforeClass
    public static void setup() {
        solution1 = new _108.Solution1();
    }

    @Test
    public void test1() {
        nums = new int[]{1, 2, 3};
        TreeUtils.printBinaryTree(solution1.sortedArrayToBST(nums));
    }

    @Test
    public void test2() {
        nums = new int[]{};
        TreeUtils.printBinaryTree(solution1.sortedArrayToBST(nums));
    }

}
@@ -646,9 +646,165 @@
 %0A    %7D%0A%0A
+    @Test%0A    public void test3() %7B%0A        nums = new int%5B%5D%7B-10, -3, 0, 5, 9%7D;%0A        TreeUtils.printBinaryTree(solution1.sortedArrayToBST(nums));%0A    %7D%0A%0A
 %7D

refactor 108