      "        if end < start:\n",
      "            return None\n",
      "        mid = (start + end) // 2\n",
      "        node = Node(array[mid])\n",
      "        node.left = self._create_min_bst(array, start, mid-1)\n",
      "        node.right = self._create_min_bst(array, mid+1, end)\n",
      "        return node"
     ]
    },
    {
     "cell_type": "markdown",
 
</s> remove     "        return self._create_min_bst(array, 0, len(array)-1)\n",
 </s> add     "        return self._create_min_bst(array, 0, len(array) - 1)\n", </s> remove    "execution_count": 2,
 </s> add    "execution_count": 1, </s> remove     "    * hanoi(n-1, buffer, dest)    \n",
 </s> add     "    * hanoi(n-1, buffer, dest, src)\n",
    "        node.left = self._create_min_bst(array, start, mid - 1)\n",
    "        node.right = self._create_min_bst(array, mid + 1, end)\n",
      "        if end < start:\n",
      "            return None\n",
      "        mid = (start + end) // 2\n",
      "        node = Node(array[mid])\n",
    "        node.left = self._create_min_bst(array, start, mid - 1)\n",
    "        node.right = self._create_min_bst(array, mid + 1, end)\n",
    "        node.left = self._create_min_bst(array, start, mid - 1)\n",
    "        node.right = self._create_min_bst(array, mid + 1, end)\n",
      "        return node"
     ]
    },
    {
     "cell_type": "markdown",
keep keep keep keep replace replace keep keep keep keep keep
 Update formatting and whitespace in a few challenges (#142) 
graphs_trees/bst_min/bst_min_solution.ipynb