Data.BinaryTree

A simple binary tree type, BinaryTree.

Documentation

data BinaryTree a

A binary tree

Since there are multiple ways to traverse a BinaryTree, see Data.Traversable.TreeLike for newtype-wrappers with Traversable instances.

Constructors

Leaf

Branch (BinaryTree a) a (BinaryTree a)

Instances

Functor BinaryTree

Methods

fmap :: (a -> b) -> BinaryTree a -> BinaryTree b

(<$) :: a -> BinaryTree b -> BinaryTree a

TreeLike BinaryTree

Methods

treeTraverse :: Applicative f => (a -> f b) -> (forall (subtree :: * -> *). TreeLike subtree => subtree a -> f (subtree b)) -> BinaryTree a -> f (BinaryTree b)

Eq a => Eq (BinaryTree a)

Methods

(==) :: BinaryTree a -> BinaryTree a -> Bool

(/=) :: BinaryTree a -> BinaryTree a -> Bool

Show a => Show (BinaryTree a)

Methods

showsPrec :: Int -> BinaryTree a -> ShowS

show :: BinaryTree a -> String

showList :: [BinaryTree a] -> ShowS