Post-order traversal visits left subtree, right subtree, root node. >>> list(postorder(make_tree())) [4, 5, 2, 3, 1]
(root: Node | None)
| 44 | |
| 45 | |
| 46 | def postorder(root: Node | None) -> Generator[int]: |
| 47 | """ |
| 48 | Post-order traversal visits left subtree, right subtree, root node. |
| 49 | >>> list(postorder(make_tree())) |
| 50 | [4, 5, 2, 3, 1] |
| 51 | """ |
| 52 | if not root: |
| 53 | return |
| 54 | yield from postorder(root.left) |
| 55 | yield from postorder(root.right) |
| 56 | yield root.data |
| 57 | |
| 58 | |
| 59 | def inorder(root: Node | None) -> Generator[int]: |