mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-07 18:08:01 +00:00
Added tree breadth first search challenge.
This commit is contained in:
27
graphs_trees/tree_bfs/test_bfs.py
Normal file
27
graphs_trees/tree_bfs/test_bfs.py
Normal file
@@ -0,0 +1,27 @@
|
||||
from __future__ import print_function
|
||||
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)
|
||||
|
||||
with captured_output() as (out, err):
|
||||
root.bfs(sys.stdout.write)
|
||||
assert_equal(out.getvalue().strip(), '52813')
|
||||
|
||||
print('Success: test_bfs')
|
||||
|
||||
|
||||
def main():
|
||||
test = TestBfs()
|
||||
test.test_bfs()
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
main()
|
||||
Reference in New Issue
Block a user