diff --git a/graphs_trees/tree_level_lists/tree_level_lists_challenge.ipynb b/graphs_trees/tree_level_lists/tree_level_lists_challenge.ipynb
index ba7ff1c..442cf21 100644
--- a/graphs_trees/tree_level_lists/tree_level_lists_challenge.ipynb
+++ b/graphs_trees/tree_level_lists/tree_level_lists_challenge.ipynb
@@ -36,7 +36,11 @@
     "\n",
     "* Is this a binary search tree?\n",
     "    * Yes\n",
+    "* Should each level be a list of nodes?\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"
    ]
   },
@@ -46,7 +50,9 @@
    "source": [
     "## Test Cases\n",
     "\n",
-    "* 5, 3, 8, 2, 4, 1, 7, 6, 9, 10, 11 -> [[5], [3, 8], [2, 4, 7, 9], [1, 6, 10], [11]]"
+    "* 5, 3, 8, 2, 4, 1, 7, 6, 9, 10, 11 -> [[5], [3, 8], [2, 4, 7, 9], [1, 6, 10], [11]]\n",
+    "\n",
+    "Note: Each number in the result is actually a node containing the number"
    ]
   },
   {
@@ -180,21 +186,21 @@
  ],
  "metadata": {
   "kernelspec": {
-   "display_name": "Python 2",
+   "display_name": "Python 3",
    "language": "python",
-   "name": "python2"
+   "name": "python3"
   },
   "language_info": {
    "codemirror_mode": {
     "name": "ipython",
-    "version": 2
+    "version": 3
    },
    "file_extension": ".py",
    "mimetype": "text/x-python",
    "name": "python",
    "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython2",
-   "version": "2.7.10"
+   "pygments_lexer": "ipython3",
+   "version": "3.5.0"
   }
  },
  "nbformat": 4,
diff --git a/graphs_trees/tree_level_lists/tree_level_lists_solution.ipynb b/graphs_trees/tree_level_lists/tree_level_lists_solution.ipynb
index dbfc106..a013bbf 100644
--- a/graphs_trees/tree_level_lists/tree_level_lists_solution.ipynb
+++ b/graphs_trees/tree_level_lists/tree_level_lists_solution.ipynb
@@ -35,7 +35,11 @@
     "\n",
     "* Is this a binary search tree?\n",
     "    * Yes\n",
+    "* Should each level be a list of nodes?\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"
    ]
   },
@@ -45,7 +49,9 @@
    "source": [
     "## Test Cases\n",
     "\n",
-    "* 5, 3, 8, 2, 4, 1, 7, 6, 9, 10, 11 -> [[5], [3, 8], [2, 4, 7, 9], [1, 6, 10], [11]]"
+    "* 5, 3, 8, 2, 4, 1, 7, 6, 9, 10, 11 -> [[5], [3, 8], [2, 4, 7, 9], [1, 6, 10], [11]]\n",
+    "\n",
+    "Note: Each number in the result is actually a node containing the number"
    ]
   },
   {
@@ -217,21 +223,21 @@
  ],
  "metadata": {
   "kernelspec": {
-   "display_name": "Python 2",
+   "display_name": "Python 3",
    "language": "python",
-   "name": "python2"
+   "name": "python3"
   },
   "language_info": {
    "codemirror_mode": {
     "name": "ipython",
-    "version": 2
+    "version": 3
    },
    "file_extension": ".py",
    "mimetype": "text/x-python",
    "name": "python",
    "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython2",
-   "version": "2.7.10"
+   "pygments_lexer": "ipython3",
+   "version": "3.5.0"
   }
  },
  "nbformat": 4,