GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-05 00:48:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

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.

Browse Source
This commit is contained in:
Donne Martin
2015-08-05 06:14:44 -04:00
parent 1c5f34eb3e
commit b109b6f8cc
10 changed files with 52 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
graphs_trees/tree_dfs/dfs_solution.ipynb
View File

@@ -136,12 +136,12 @@
"def in_order_traversal(node, visit_func):\n",
" if node is not None:\n",
" in_order_traversal(node.left, visit_func)\n",
" visit_func(node.data)\n",
" visit_func(node)\n",
" in_order_traversal(node.right, visit_func)\n",
"\n",
"def pre_order_traversal(node, visit_func):\n",
" if node is not None:\n",
" visit_func(node.data)\n",
" visit_func(node)\n",
" pre_order_traversal(node.left, visit_func)\n",
" pre_order_traversal(node.right, visit_func)\n",
"\n",
@@ -149,7 +149,7 @@
" if node is not None:\n",
" post_order_traversal(node.left, visit_func)\n",
" post_order_traversal(node.right, visit_func)\n",
" visit_func(node.data)"
" visit_func(node)"
]
},
{