Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Tree.Extended

Synopsis

traverseTree :: (Tree a -> mem -> mem) -> (mem -> Maybe (Tree a, mem)) -> mem -> [a]
depthFirst :: Tree a -> [a]
breadthFirst :: Tree a -> [a]
module Data.Tree

Documentation

Arguments

:: (Tree a -> mem -> mem)	Put a tree onto the to-visit list
-> (mem -> Maybe (Tree a, mem))	Get a tree from the to-visit list
-> mem	To-visit list; initially the first node of the tree
-> [a]

Breadth-first toList.