Îõ³h$a$    1Implementation of a non-deterministic tree monad.(c) Nathan Bedell, 2021MITnbedell@tulane.edu Safe-Inferred2>?À monad-tree9Simple rose-tree data structure, with labels of type n for nodel, labels of types b" for branches, containers of type f5 used to branch on tree nodes, and values of type a at the leaves.f will usually be []Ü, but this was kept generic to allow for the use of more efficent containers if relevant. monad-tree"dfs with a predicate on the labels monad-treeDepth first search of a tree monad-tree4Breadth first search with a predicate on the labels. monad-tree(Breadth first search algorithm for trees      'monad-tree-0.1.0-DU49mwKuR8GCQmXPKmmuZoControl.Monad.TreeTreeLeafNodedfs'dfsbfs'bfs$fAlternativeTree $fMonadTree$fApplicativeTree $fFunctorTree$fEqTree