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

Simpilfied bst challenge.

Browse Source
This commit is contained in:
Donne Martin
2015-08-01 17:44:14 -04:00
parent e55c7ee1c6
commit 31058abf3a
5 changed files with 106 additions and 63 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
graphs_trees/bst/dfs.py Normal file
View File

@@ -0,0 +1,17 @@
def in_order_traversal(node, visit_func):
if node is not None:
in_order_traversal(node.left, visit_func)
visit_func(node.data)
in_order_traversal(node.right, visit_func)
def pre_order_traversal(node, visit_func):
if node is not None:
visit_func(node.data)
pre_order_traversal(node.left, visit_func)
pre_order_traversal(node.right, visit_func)
def post_order_traversal(node, visit_func):
if node is not None:
post_order_traversal(node.left, visit_func)
post_order_traversal(node.right, visit_func)
visit_func(node.data)