online advertising

Sunday, June 7, 2015

AVL tree in Haskell

In order to optimize Haskell 99 problem 23, I built an AVL tree in Haskell as follow:

This is pretty standard, the implementation gears towards actual usage in the problem. For example, there isn't a contains function or deleteByValue function. They can be added easily if wished.

No comments :

Post a Comment