Simplified challenge coding and unit tests by working with the node directly as opposed to node.id or node.data, which is more natural when writing coding challenges.

2026-01-03 16:08:02 +00:00 · 2015-08-05 06:14:44 -04:00
parent 1c5f34eb3e
commit b109b6f8cc
10 changed files with 52 additions and 13 deletions
--- a/graphs_trees/tree_bfs/bfs_solution.ipynb
+++ b/graphs_trees/tree_bfs/bfs_solution.ipynb
@@ -98,7 +98,7 @@
    "    queue.append(root)\n",
    "    while queue:\n",
    "        node = queue.popleft()\n",
-    "        visit_func(node.data)\n",
+    "        visit_func(node)\n",
    "        if node.left is not None:\n",
    "            queue.append(node.left)\n",
    "        if node.right is not None:\n",