Class Node

binary-trees/minimal-tree.js:11–17

* MINIMAL TREE * Given a sorted (increasing order) array with unique integer values, * write an algorithm to create a binary search tree (BST) with * minimal height * * Time O(n) - where n is the length of the input array * Space O(n)

 */

class Node {
  constructor(value) {
    this.value = value;
    this.left = null;
    this.right = null;
  }
}

function createMinimalBST(arr) {
  return createMinimalBSTHelper(arr, 0, arr.length - 1);