Implementation of AVL trees in functional programming language Haskell. You may find implemented some basic operations such as inserting, searching for a specific node and balancing the tree after each node insertion.
You may run the code from an IDE or directly from ghci terminal.
Implementation of BST trees in functional programming language Haskell. You may find implemented some basic operations such as inserting, searching, counting and collecting leaves and internal nodes.
You may also find the implementation of some built-in functions as well as selection, insertion, bubble, quick and merge sort.