def traverse_breadth_first(self, callback, queue):
            callback(self)
            for k in self.children:
                queue.append(self.children[k])
            if queue:
                queue[0].traverse_breadh_first_top_down(callback, queue[1:])
Traverses the tree in breadth-first top-down order,
dataset/ETHPy150Open mikhaildubov/AST-text-analysis/east/asts/ast.py/AnnotatedSuffixTree.Node.traverse_breadth_first