Data.Tree

Documentation

data Tree v a

Multary (Rose) Tree

Constructors

Node a (Forest v a)

Instances

Functor v => Functor (Tree v)

(Functor v, Alternative v) => Applicative (Tree v)

Foldable v => Foldable (Tree v)

Traversable v => Traversable (Tree v)

(Eq a, Eq (Forest v a)) => Eq (Tree v a)

type Forest v a = v (Tree v a)

flatten :: Foldable v => Tree v a -> [a]

levels :: (Applicative v, Foldable v, Monoid (v a)) => Tree v a -> [v a]

Lists of nodes at each level of tree

unfoldTree :: Functor v => (b -> (a, v b)) -> b -> Tree v a

Build tree from seed value

unfoldTreeM :: (Monad m, Traversable v) => (b -> m (a, v b)) -> b -> m (Tree v a)

Build a tree from seed value, monadically