interactive-coding-challenges/graphs_trees/bst/test_bst.py
Donne Martin de0e70de4f Polish bst challenge and solution
Add root is None input test case.  Update time and space complexity discussion.
2016-03-01 07:03:37 -05:00

36 lines
797 B
Python

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)
in_order_traversal(node, self.results.add_result)
assert_equal(str(self.results), '[1, 2, 3, 5, 8]')
self.results.clear_results()
node = insert(None, 1)
insert(node, 2)
insert(node, 3)
insert(node, 4)
insert(node, 5)
in_order_traversal(node, self.results.add_result)
assert_equal(str(self.results), '[1, 2, 3, 4, 5]')
print('Success: test_tree')
def main():
test = TestTree()
test.test_tree()
if __name__ == '__main__':
main()