     "outputs": [],
     "source": [
      "def create_min_bst(array):\n",
      "    # TODO: Implement me\n",
      "    # Calls __create_min_bst__\n",
      "    pass    \n",
      "\n",
      "\n",
      "def __create_min_bst__(array, start, end):\n",
      "    # TODO: Implement me\n",
 
</s> remove     "def __create_min_bst__(array, start, end):\n",
 </s> add     "def _create_min_bst(array, start, end):\n", </s> remove     "    return __create_min_bst__(array, 0, len(array)-1)\n",
 </s> add     "    return _create_min_bst(array, 0, len(array)-1)\n", </s> remove     "def __create_min_bst__(array, start, end):\n",
 </s> add     "def _create_min_bst(array, start, end):\n", </s> remove     "        return\n",
 </s> add     "        return None\n", </s> remove     "    node.left = __create_min_bst__(array, start, mid-1)\n",
    "    node.right = __create_min_bst__(array, mid+1, end)\n",
 </s> add     "    node.left = _create_min_bst(array, start, mid-1)\n",
    "    node.right = _create_min_bst(array, mid+1, end)\n",
    "    # Calls _create_min_bst\n",
     "outputs": [],
     "source": [
      "def create_min_bst(array):\n",
      "    # TODO: Implement me\n",
    "    # Calls _create_min_bst\n",
      "    pass    \n",
      "\n",
      "\n",
      "def __create_min_bst__(array, start, end):\n",
      "    # TODO: Implement me\n",
keep keep keep keep replace keep keep keep keep keep
 Polish bst min challenge and solution (#76)

Update constraints, algorithm discussion, and code. 
graphs_trees/bst_min/bst_min_challenge.ipynb