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

Simpilfied breadth first search challenge.

Browse Source
This commit is contained in:
Donne Martin
2015-08-01 17:48:12 -04:00
parent 31058abf3a
commit 332230c3a1
3 changed files with 50 additions and 65 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
graphs_trees/tree_bfs/test_bfs.py
View File

@@ -5,14 +5,14 @@ from nose.tools import assert_equal
class TestBfs(object):
def test_bfs(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.bfs(sys.stdout.write)
bfs(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '52813')
print('Success: test_bfs')