interactive-coding-challenges/graphs_trees/bst/test_bst.py

36 lines
951 B
Python
Raw Normal View History

2015-08-01 21:25:14 +08:00
from nose.tools import assert_equal
class TestTree(object):
2015-08-05 07:33:42 +08:00
def __init__(self):
self.results = Results()
2015-08-01 21:25:14 +08:00
def test_tree(self):
2015-08-02 05:44:14 +08:00
node = Node(5)
assert_equal(insert(node, 2).data, 2)
assert_equal(insert(node, 8).data, 8)
assert_equal(insert(node, 1).data, 1)
assert_equal(insert(node, 3).data, 3)
2015-08-05 07:33:42 +08:00
in_order_traversal(node, self.results.add_result)
assert_equal(str(self.results), '[1, 2, 3, 5, 8]')
self.results.clear_results()
2015-08-01 21:25:14 +08:00
node = insert(None, 1)
assert_equal(insert(node, 2).data, 2)
assert_equal(insert(node, 3).data, 3)
assert_equal(insert(node, 4).data, 4)
2015-08-02 05:44:14 +08:00
insert(node, 5)
2015-08-05 07:33:42 +08:00
in_order_traversal(node, self.results.add_result)
assert_equal(str(self.results), '[1, 2, 3, 4, 5]')
2015-08-01 21:25:14 +08:00
print('Success: test_tree')
def main():
test = TestTree()
test.test_tree()
if __name__ == '__main__':
main()