def createBST(sortedList, start, end):
if start > end:
return None
middle = (start + end) // 2
node = BinaryTreeNode(sortedList[middle])
node.left = createBST(sortedList, start, middle - 1)
node.right = createBST(sortedList, middle + 1, end)
return node
