def test_breadth_first_traverse_gen_on_one_level_tree(self):
node1 = TreeNode('1')
node11 = node1.add_child('11')
node12 = node1.add_child('12')
node13 = node1.add_child('13')
generated_nodes = [n for n in node1.breadth_first_traverse_gen()]
self.assertEqual([node1, node11, node12, node13], generated_nodes)
def test_breadth_first_traverse_gen_on_one_level_tree(self):
node1 = TreeNode('1')
node11 = node1.set_left('11')
node12 = node1.set_right('12')
generated_nodes = [ n for n in node1.breadth_first_traverse_gen() ]
self.assertEqual([ node1,
node11, node12 ],
generated_nodes)
def test_breadth_first_traverse_gen_on_one_node(self):
node = TreeNode('a')
generated_nodes = [n for n in node.breadth_first_traverse_gen()]
self.assertEqual([node], generated_nodes)
node122 = node12.add_child('Mary')
node13 = node1.add_child('Mark')
node2 = root.add_child('Bill')
node21 = node2.add_child('Grace')
root.display()
print('***** DEPTH-FIRST GENERATOR ITERATION *****')
for node in root.depth_first_traverse_gen():
print(node)
print('***** DEPTH-FIRST ITERATION *****')
root.depth_first_traverse(print)
print('***** BREADTH-FIRST GENERATOR ITERATION *****')
for node in root.breadth_first_traverse_gen():
print(node)
print('***** BREADTH-FIRST ITERATION *****')
root.breadth_first_traverse(print)
print('***** HEIGHT *****')
print(node12111.height)
print(node1211.height)
print(node121.height)
print(node122.height)
print(node11.height)
print(node12.height)
print(node13.height)
print(node1.height)
print(node2.height)
