This notebook was prepared by Donne Martin. Source and license info is on GitHub.
visit_func
on the nodeRefer to the Solution Notebook. If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start.
%run ../bst/bst.py
%load ../bst/bst.py
class BstBfs(Bst):
def bfs(self, visit_func):
# TODO: Implement me
pass
%run ../utils/results.py
# %load test_bfs.py
import unittest
class TestBfs(unittest.TestCase):
def __init__(self, *args, **kwargs):
super(TestBfs, self).__init__()
self.results = Results()
def test_bfs(self):
bst = BstBfs(Node(5))
bst.insert(2)
bst.insert(8)
bst.insert(1)
bst.insert(3)
bst.bfs(self.results.add_result)
self.assertEqual(str(self.results), '[5, 2, 8, 1, 3]')
print('Success: test_bfs')
def main():
test = TestBfs()
test.test_bfs()
if __name__ == '__main__':
main()
Review the Solution Notebook for a discussion on algorithms and code solutions.