(tree)
| 36 | |
| 37 | from utils import _make_path_relative |
| 38 | def find_first_node_with_two_children(tree): |
| 39 | for key, subtree in tree.items(): |
| 40 | if len(subtree) >= 2: |
| 41 | return key, subtree |
| 42 | result = find_first_node_with_two_children(subtree) |
| 43 | if result: |
| 44 | return result |
| 45 | return None, None |
| 46 | |
| 47 | |
| 48 | def filt_tree(tree): |