def test_create_tree_2(self):
# A tree with root, three children.
t = Tree('r')
t._add(t.root(), 'a')
t._add(t.root(), 'b')
t._add(t.root(), 'c')
self.assertEqual(t.height(), 1)
self.assertEqual(len(t), 4)
def test_create_tree_3(self):
t = Tree()
a = t._add(t.root(), 'a')
t._add(t.root(), 'b')
t._add(t.root(), 'c')
t._add(a, 'aa')
self.assertEqual(t.height(), 2)
# Single child node of node a contains value 'aa' as element.
self.assertEqual(t.children(a)[0].element(), 'aa')
def test_bfs_1(self):
t = Tree('a')
b = t._add(t.root(), 'b')
t._add(b, 'd')
c = t._add(t.root(), 'c')
t._add(c, 'e')
f = t._add(c, 'f')
t._add(f, 'g')
self.assertEqual([x.element() for x in t.bfs()],
['a', 'b', 'c', 'd', 'e', 'f', 'g'])