▽Planet Haskell ●04/01 01:37 March 30, 2025Lysxia's blogUnfolding trees breadth-first in HaskellTo visit a tree or graph in breadth-first order, there are two mainimplementation approaches: queue-based or level-based.Our goal here is to develop a level-based approach where the levels ofthe breadth-first walk are constructed compositionally and dynamically.Compositionality means that for every node, its descendants—the