r""" Return a binary tree with 7 nodes that looks like this: :: 1 / \ 2 3 / \ / \ 4 5 6 7 >>> tree_seven = make_tree_seven() >>> len(tree_seven) 7 >>> list(tree_seven) [4, 2, 5, 1, 6, 3, 7]
()
| 54 | |
| 55 | |
| 56 | def make_tree_seven() -> Node: |
| 57 | r""" |
| 58 | Return a binary tree with 7 nodes that looks like this: |
| 59 | :: |
| 60 | |
| 61 | 1 |
| 62 | / \ |
| 63 | 2 3 |
| 64 | / \ / \ |
| 65 | 4 5 6 7 |
| 66 | |
| 67 | >>> tree_seven = make_tree_seven() |
| 68 | >>> len(tree_seven) |
| 69 | 7 |
| 70 | >>> list(tree_seven) |
| 71 | [4, 2, 5, 1, 6, 3, 7] |
| 72 | """ |
| 73 | tree = Node(1) |
| 74 | tree.left = Node(2) |
| 75 | tree.right = Node(3) |
| 76 | tree.left.left = Node(4) |
| 77 | tree.left.right = Node(5) |
| 78 | tree.right.left = Node(6) |
| 79 | tree.right.right = Node(7) |
| 80 | return tree |
| 81 | |
| 82 | |
| 83 | def make_tree_nine() -> Node: |