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

Simpilfied depth first search challenge.

Browse Source
This commit is contained in:
Donne Martin
2015-08-01 17:48:52 -04:00
parent 332230c3a1
commit 13d08b80fd
3 changed files with 95 additions and 113 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
graphs_trees/tree_dfs/test_dfs.py
View File

@@ -5,40 +5,40 @@ from nose.tools import assert_equal
class TestDfs(object):
def test_dfs(self):
root = Node(5)
root.insert(2)
root.insert(8)
root.insert(1)
root.insert(3)
node = Node(5)
insert(node, 2)
insert(node, 8)
insert(node, 1)
insert(node, 3)
with captured_output() as (out, err):
root.in_order_traversal(sys.stdout.write)
in_order_traversal(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '12358')
with captured_output() as (out, err):
root.pre_order_traversal(sys.stdout.write)
pre_order_traversal(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '52138')
with captured_output() as (out, err):
root.post_order_traversal(sys.stdout.write)
post_order_traversal(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '13285')
root = Node(1)
root.insert(2)
root.insert(3)
root.insert(4)
root.insert(5)
node = Node(1)
insert(node, 2)
insert(node, 3)
insert(node, 4)
insert(node, 5)
with captured_output() as (out, err):
root.in_order_traversal(sys.stdout.write)
in_order_traversal(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '12345')
with captured_output() as (out, err):
root.pre_order_traversal(sys.stdout.write)
pre_order_traversal(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '12345')
with captured_output() as (out, err):
root.post_order_traversal(sys.stdout.write)
post_order_traversal(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '54321')
print('Success: test_dfs')