[Haskell-beginners] [Fwd: Binary tree algorithm]

Scott Kidder scott.kidder11 at gmail.com
Fri May 7 17:57:27 EDT 2010

Have a look at AVL Trees or Red-black trees. They are both types of self
balancing trees which is what I think you're looking for.
- Scott Kidder
()  ascii ribbon campaign - against html e-mail 
/\  www.asciiribbon.org   - against proprietary attachments

More information about the Beginners mailing list