gistfile1.java

// given a sorted array, create a BST
public static void add(int[] arr, int start, int end) {
    int mid = (start + end) / 2;
    TreeNode n = new TreeNode(arr[mid]);
    n.left = add(arr, start, mid-1);
    n.right = add(arr, mid+1, end);
    return n
}
    
public static TreeNode makeBST(int[] arr, int start, int end) {
    add(arr, 0 arr.length-1);
}

// bst -> array -> bst