(tree, node)
| 89 | |
| 90 | |
| 91 | def node_parent(tree, node): |
| 92 | to_visit = [tree.root_node] |
| 93 | while len(to_visit) > 0: |
| 94 | next_node = to_visit.pop() |
| 95 | for child in next_node.children: |
| 96 | if nodes_are_equal(child, node): |
| 97 | return next_node |
| 98 | else: |
| 99 | to_visit.extend(next_node.children) |
| 100 | raise ValueError("Could not find node in tree.") |
| 101 | |
| 102 | |
| 103 | def traverse(node, results: List) -> None: |
no test coverage detected