      "### Insert\n",
      "\n",
      "Insert will be tested through the following traversal:\n",
      "\n",
      "### In-Order Traversal (Provided)\n",
      "\n",
      "* 5, 2, 8, 1, 3 -> 1, 2, 3, 5, 8\n",
      "* 1, 2, 3, 4, 5 -> 1, 2, 3, 4, 5\n",
      "\n",
      "If the `root` input is `None`, return a tree with the only element being the new root node."
 
</s>
    "### In-Order Traversal\n",
      "### Insert\n",
      "\n",
      "Insert will be tested through the following traversal:\n",
      "\n",
    "### In-Order Traversal\n",
      "\n",
      "* 5, 2, 8, 1, 3 -> 1, 2, 3, 5, 8\n",
      "* 1, 2, 3, 4, 5 -> 1, 2, 3, 4, 5\n",
      "\n",
      "If the `root` input is `None`, return a tree with the only element being the new root node."
keep keep keep keep replace keep keep keep keep keep
 Polish bst challenge and solution (#75)

Update constraints, algorithm discussion, and code.
graphs_trees/bst/bst_solution.ipynb