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

Reworked bst unit tests.

Browse Source
This commit is contained in:
Donne Martin
2015-08-04 19:33:42 -04:00
parent 9dc4116256
commit 72e133a96c
3 changed files with 35 additions and 34 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
graphs_trees/bst/test_bst.py
View File

@@ -1,29 +1,28 @@
from __future__ import print_function
from nose.tools import assert_equal
class TestTree(object):
def __init__(self):
self.results = Results()
def test_tree(self):
node = Node(5)
insert(node, 2)
insert(node, 8)
insert(node, 1)
insert(node, 3)
with captured_output() as (out, err):
in_order_traversal(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '12358')
in_order_traversal(node, self.results.add_result)
assert_equal(str(self.results), '[1, 2, 3, 5, 8]')
self.results.clear_results()
node = Node(1)
insert(node, 2)
insert(node, 3)
insert(node, 4)
insert(node, 5)
with captured_output() as (out, err):
in_order_traversal(node, sys.stdout.write)
assert_equal(out.getvalue().strip(), '12345')
in_order_traversal(node, self.results.add_result)
assert_equal(str(self.results), '[1, 2, 3, 4, 5]')
print('Success: test_tree')