Data.Chatty.AVL

Provides an AVL tree.

Documentation

avlMax :: AVL i -> Maybe i

Get the greatest element.

avlMin :: AVL i -> Maybe i

Get the least element.

avlLookup :: Indexable i o v => o -> AVL i -> Maybe v

Lookup a given key.

avlHeight :: AVL i -> Int

Get the height of the tree.

avlSize :: AVL i -> Int

Get the size of the tree.

avlInsert :: Indexable i o v => i -> AVL i -> AVL i

Insert into the tree.

avlRemove :: Indexable i o v => o -> AVL i -> AVL i

Remove from the tree.

data AVL a

An AVL tree.

Constructors

EmptyAVL

AVL a Int Int !(AVL a) !(AVL a)

Instances

Functor AVL

Defined in Data.Chatty.AVL

Methods

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

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

Indexable i o v => AnyBST AVL i o v

Defined in Data.Chatty.AVL

Methods

anyBstInsert :: i -> AVL i -> AVL i

anyBstRemove :: o -> AVL i -> AVL i

anyBstMax :: AVL i -> Maybe i

anyBstMin :: AVL i -> Maybe i

anyBstLookup :: o -> AVL i -> Maybe v

anyBstEmpty :: AVL i

anyBstHead :: AVL i -> Maybe i

anyBstInorder :: AVL i -> [i]

None (AVL a)

Defined in Data.Chatty.AVL

Methods

none :: AVL a

avlRoot :: AVL i -> i

Get the root of the tree.

avlPreorder :: AVL i -> [i]

Traverse the tree, order (head, left, right)

avlPostorder :: AVL i -> [i]

Traverse the tree, order (left, right, head)

avlInorder :: AVL i -> [i]

Traverse the tree, order (left, head, right)