r""" Return a binary tree with 9 nodes that looks like this: :: 1 / \ 2 3 / \ \ 4 5 6 / \ \ 7 8 9 >>> tree_nine = make_tree_nine() >>> len(tree_nine) 9 >>> list(tree_nine) [7, 4, 8, 2, 5, 9, 1,
()
| 81 | |
| 82 | |
| 83 | def make_tree_nine() -> Node: |
| 84 | r""" |
| 85 | Return a binary tree with 9 nodes that looks like this: |
| 86 | :: |
| 87 | |
| 88 | 1 |
| 89 | / \ |
| 90 | 2 3 |
| 91 | / \ \ |
| 92 | 4 5 6 |
| 93 | / \ \ |
| 94 | 7 8 9 |
| 95 | |
| 96 | >>> tree_nine = make_tree_nine() |
| 97 | >>> len(tree_nine) |
| 98 | 9 |
| 99 | >>> list(tree_nine) |
| 100 | [7, 4, 8, 2, 5, 9, 1, 3, 6] |
| 101 | """ |
| 102 | tree = Node(1) |
| 103 | tree.left = Node(2) |
| 104 | tree.right = Node(3) |
| 105 | tree.left.left = Node(4) |
| 106 | tree.left.right = Node(5) |
| 107 | tree.right.right = Node(6) |
| 108 | tree.left.left.left = Node(7) |
| 109 | tree.left.left.right = Node(8) |
| 110 | tree.left.right.right = Node(9) |
| 111 | return tree |
| 112 | |
| 113 | |
| 114 | def main() -> None: |