Safe Haskell | None |
---|
Provides an AVL tree.
- avlMax :: AVL i -> Maybe i
- avlMin :: AVL i -> Maybe i
- avlLookup :: Indexable i o v => o -> AVL i -> Maybe v
- avlHeight :: AVL i -> Int
- avlSize :: AVL i -> Int
- avlInsert :: Indexable i o v => i -> AVL i -> AVL i
- avlRemove :: Indexable i o v => o -> AVL i -> AVL i
- data AVL a
- avlRoot :: AVL i -> i
- avlPreorder :: AVL i -> [i]
- avlPostorder :: AVL i -> [i]
- avlInorder :: AVL i -> [i]
Documentation
An AVL tree.
avlPreorder :: AVL i -> [i]Source
Traverse the tree, order (head, left, right)
avlPostorder :: AVL i -> [i]Source
Traverse the tree, order (left, right, head)
avlInorder :: AVL i -> [i]Source
Traverse the tree, order (left, head, right)