diff --git a/graphs_trees/bst/bst_challenge.ipynb b/graphs_trees/bst/bst_challenge.ipynb
index 479c637..e971ef7 100644
--- a/graphs_trees/bst/bst_challenge.ipynb
+++ b/graphs_trees/bst/bst_challenge.ipynb
@@ -39,8 +39,6 @@
     "    * Yes\n",
     "* Can we assume all left descendents <= n < all right descendents?\n",
     "    * Yes\n",
-    "* For simplicity, can we use just a Node class without a wrapper Tree class?\n",
-    "    * Yes\n",
     "* Do we have to keep track of the parent nodes?\n",
     "    * This is optional\n",
     "* Can we assume this fits in memory?\n",
diff --git a/graphs_trees/bst/bst_solution.ipynb b/graphs_trees/bst/bst_solution.ipynb
index f155c19..fd42d3f 100644
--- a/graphs_trees/bst/bst_solution.ipynb
+++ b/graphs_trees/bst/bst_solution.ipynb
@@ -39,8 +39,6 @@
     "    * Yes\n",
     "* Can we assume all left descendents <= n < all right descendents?\n",
     "    * Yes\n",
-    "* For simplicity, can we use just a Node class without a wrapper Tree class?\n",
-    "    * Yes\n",
     "* Do we have to keep track of the parent nodes?\n",
     "    * This is optional\n",
     "* Can we assume this fits in memory?\n",