Visualizer › Trees
Postorder Traversal
Visits both subtrees first and the node last.
How it works
- Left → Right → Root.
- Used to delete a tree or compute heights and sizes bottom-up.
- Many tree DP problems are postorder.
Complexity
- Best time: O(n)
- Average time: O(n)
- Worst time: O(n)
- Extra space: O(h)
Code (Python)
def postorder(node, out):
if node:
postorder(node.left, out)
postorder(node.right, out)
out.append(node.val)Practise: Trees problems