Postorder traversal
= Postorder traversal
Visit all child <subtrees> before visiting their parent. A <depth-first traversal of a tree> produces this order by processing a node on return from its recursive calls. It lets <dynamic programming> use the already computed answers of every child <subtree>.