AvlTree Balanced binary trees in Haskell using the AVL algorithm
Download

AvlTree Ranking & Summary

AvlTree Tags

library algorithm AVL tree library haskell AVL tree AVl algorithm AVL tree

AvlTree Description

Balanced binary trees in Haskell using the AVL algorithm AvlTree represents a free, open source, comprehensive and efficient implementation of AVL trees in Haskell. The raw AVL API has been designed with efficiency and generality in mind, not elagance or safety. It contains all the stuff you really don't want to write yourself if you can avoid it. The AvlTree library may be useful for rolling your own Sets, Sequences, Queues, Maps, etc. Requirements: · GHC

AvlTree Related Software