Data.Tree makes Tree into a Traversable in only one way: depth-first. It seems to me that we should have a newtype to traverse in breadth-first order. David Feuer -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://mail.haskell.org/pipermail/libraries/attachments/20150420/dcc8448b/attachment.html>