From 098aaf196de924401d5d093293be810e8bc4f672 Mon Sep 17 00:00:00 2001
From: Donne Martin <donne.martin@gmail.com>
Date: Thu, 26 Jan 2017 04:55:45 -0500
Subject: [PATCH] Update formatting and whitespace in a few challenges (#142)

---
 graphs_trees/bst_min/bst_min_solution.ipynb  | 8 ++++----
 graphs_trees/graph/graph_challenge.ipynb     | 1 +
 graphs_trees/graph/graph_solution.ipynb      | 1 +
 recursion_dynamic/hanoi/hanoi_solution.ipynb | 4 ++--
 4 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/graphs_trees/bst_min/bst_min_solution.ipynb b/graphs_trees/bst_min/bst_min_solution.ipynb
index 6e28364..4869b26 100644
--- a/graphs_trees/bst_min/bst_min_solution.ipynb
+++ b/graphs_trees/bst_min/bst_min_solution.ipynb
@@ -93,7 +93,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 2,
+   "execution_count": 1,
    "metadata": {
     "collapsed": false
    },
@@ -107,15 +107,15 @@
     "    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",
+    "        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",
     "        node = Node(array[mid])\n",
-    "        node.left = self._create_min_bst(array, start, mid-1)\n",
-    "        node.right = self._create_min_bst(array, mid+1, end)\n",
+    "        node.left = self._create_min_bst(array, start, mid - 1)\n",
+    "        node.right = self._create_min_bst(array, mid + 1, end)\n",
     "        return node"
    ]
   },
diff --git a/graphs_trees/graph/graph_challenge.ipynb b/graphs_trees/graph/graph_challenge.ipynb
index 091ae49..a00aac7 100644
--- a/graphs_trees/graph/graph_challenge.ipynb
+++ b/graphs_trees/graph/graph_challenge.ipynb
@@ -106,6 +106,7 @@
     "\n",
     "\n",
     "class State(Enum):\n",
+    "\n",
     "    unvisited = 0\n",
     "    visiting = 1\n",
     "    visited = 2\n",
diff --git a/graphs_trees/graph/graph_solution.ipynb b/graphs_trees/graph/graph_solution.ipynb
index 0d392d6..1c9cc99 100644
--- a/graphs_trees/graph/graph_solution.ipynb
+++ b/graphs_trees/graph/graph_solution.ipynb
@@ -170,6 +170,7 @@
     "\n",
     "\n",
     "class State(Enum):\n",
+    "\n",
     "    unvisited = 0\n",
     "    visiting = 1\n",
     "    visited = 2\n",
diff --git a/recursion_dynamic/hanoi/hanoi_solution.ipynb b/recursion_dynamic/hanoi/hanoi_solution.ipynb
index 785a8fd..f8a45f2 100644
--- a/recursion_dynamic/hanoi/hanoi_solution.ipynb
+++ b/recursion_dynamic/hanoi/hanoi_solution.ipynb
@@ -62,9 +62,9 @@
     "* Create three stacks to represent each tower\n",
     "* def hanoi(n, src, dest, buffer):\n",
     "    * If 0 disks return\n",
-    "    * hanoi(n-1, src, buffer)\n",
+    "    * hanoi(n-1, src, buffer, dest)\n",
     "    * Move remaining element from src to dest\n",
-    "    * hanoi(n-1, buffer, dest)    \n",
+    "    * hanoi(n-1, buffer, dest, src)\n",
     "\n",
     "Complexity:\n",
     "* Time: O(2^n)\n",