Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minial height.

buildMinHeightBST.ts

// given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minial height.
class BinaryNode<T> {
  data: T
  leftChild: BinaryNode<T>
  rightChild: BinaryNode<T>

  constructor(data: T) {
    this.data = data
  }
}

function buildTree(lst: number[]) {
  if (!lst || lst.length === 0) return null
  if (lst.length === 1) return new BinaryNode(lst[0])

  const medianIndex = Math.ceil((lst.length - 1) / 2)
  const node = new BinaryNode(lst[medianIndex])
  node.leftChild = buildTree(lst.slice(0, medianIndex))
  node.rightChild = buildTree(lst.slice(medianIndex + 1, lst.length))

  return node
}

console.log('build tree', buildTree([1,2,3,4,5,6,7,8]))