def test_traverse_breadth_first(self, sync, nodes):
tree = Tree(sync)
root = tree.build(nodes[0])
root.display()
for i, node in enumerate(traverse_breadth_first(root)):
if i == 0:
assert node.table == 'book'
if i == 1:
assert node.table == 'publisher'
if i == 2:
assert node.table == 'book_language'
if i == 3:
assert node.table == 'author'
if i == 4:
assert node.table == 'language'
if i == 5:
assert node.table == 'subject'
if i == 6:
assert node.table == 'city'
if i == 7:
assert node.table == 'country'
if i == 8:
assert node.table == 'continent'
def test_traverse_post_order(self, sync, nodes):
tree = Tree(sync)
root = tree.build(nodes)
root.display()
for i, node in enumerate(traverse_post_order(root)):
if i == 0:
assert node.table == "publisher"
if i == 1:
assert node.table == "book_language"
if i == 2:
assert node.table == "continent"
if i == 3:
assert node.table == "country"
if i == 4:
assert node.table == "city"
if i == 5:
assert node.table == "author"
if i == 6:
assert node.table == "language"
if i == 7:
assert node.table == "subject"
if i == 8:
assert node.table == "book"
