      "    * Yes\n",
      "* Are the array elements unique?\n",
      "    * Yes\n",
      "* Can we assume we already have a Node class with an insert method?\n",
      "    * Yes"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
 
</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", </s> remove     "def __create_min_bst__(array, start, end):\n",
 </s> add     "def _create_min_bst(array, start, end):\n", </s> remove    "display_name": "Python 2",
 </s> add    "display_name": "Python 3", </s> remove    "display_name": "Python 2",
 </s> add    "display_name": "Python 3",
    "    * Yes\n",
    "* Can we assume this fits memory?\n",
      "    * Yes\n",
      "* Are the array elements unique?\n",
      "    * Yes\n",
      "* Can we assume we already have a Node class with an insert method?\n",
    "    * Yes\n",
    "* Can we assume this fits memory?\n",
      "    * Yes"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
keep keep keep add keep 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