interactive-coding-challenges/graphs_trees/tree_dfs/test_dfs.py

54 lines
1.4 KiB
Python
Raw Normal View History

from nose.tools import assert_equal
class TestDfs(object):
2015-08-05 07:35:19 +08:00
def __init__(self):
self.results = Results()
def test_dfs(self):
2016-08-14 20:27:35 +08:00
bst = BstDfs(Node(5))
bst.insert(2)
bst.insert(8)
bst.insert(1)
bst.insert(3)
2016-08-14 20:27:35 +08:00
bst.in_order_traversal(bst.root, self.results.add_result)
2015-08-05 07:35:19 +08:00
assert_equal(str(self.results), "[1, 2, 3, 5, 8]")
self.results.clear_results()
2016-08-14 20:27:35 +08:00
bst.pre_order_traversal(bst.root, self.results.add_result)
2015-08-05 07:35:19 +08:00
assert_equal(str(self.results), "[5, 2, 1, 3, 8]")
self.results.clear_results()
2016-08-14 20:27:35 +08:00
bst.post_order_traversal(bst.root, self.results.add_result)
2015-08-05 07:35:19 +08:00
assert_equal(str(self.results), "[1, 3, 2, 8, 5]")
self.results.clear_results()
2016-08-14 20:27:35 +08:00
bst = BstDfs(Node(1))
bst.insert(2)
bst.insert(3)
bst.insert(4)
bst.insert(5)
2016-08-14 20:27:35 +08:00
bst.in_order_traversal(bst.root, self.results.add_result)
2015-08-05 07:35:19 +08:00
assert_equal(str(self.results), "[1, 2, 3, 4, 5]")
self.results.clear_results()
2016-08-14 20:27:35 +08:00
bst.pre_order_traversal(bst.root, self.results.add_result)
2015-08-05 07:35:19 +08:00
assert_equal(str(self.results), "[1, 2, 3, 4, 5]")
self.results.clear_results()
2016-08-14 20:27:35 +08:00
bst.post_order_traversal(bst.root, self.results.add_result)
2015-08-05 07:35:19 +08:00
assert_equal(str(self.results), "[5, 4, 3, 2, 1]")
print('Success: test_dfs')
def main():
test = TestDfs()
test.test_dfs()
if __name__ == '__main__':
main()