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

Reworked tree bfs unit tests.

Browse Source
This commit is contained in:
Donne Martin
2015-08-04 19:34:54 -04:00
parent 72e133a96c
commit db798ed6a7
3 changed files with 24 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
graphs_trees/tree_bfs/test_bfs.py
View File

@@ -1,19 +1,19 @@
from __future__ import print_function
from nose.tools import assert_equal
class TestBfs(object):
def __init__(self):
self.results = Results()
def test_bfs(self):
node = Node(5)
insert(node, 2)
insert(node, 8)
insert(node, 1)
insert(node, 3)
with captured_output() as (out, err):
bfs(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '52813')
bfs(node, self.results.add_result)
assert_equal(str(self.results), '[5, 2, 8, 1, 3]')
print('Success: test_bfs')