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