https://github.com/rcardin/btrees

A simple implementation of Binary Search Trees using Haskell (just for fun).
https://github.com/rcardin/btrees

binary-search-tree haskell haskell-learning

Last synced: about 1 month ago
JSON representation

A simple implementation of Binary Search Trees using Haskell (just for fun).

• Host: GitHub
• URL: https://github.com/rcardin/btrees
• Owner: rcardin
• License: bsd-3-clause
• Created: 2018-12-27T14:21:51.000Z (about 7 years ago)
• Default Branch: master
• Last Pushed: 2018-12-31T13:21:57.000Z (about 7 years ago)
• Last Synced: 2025-01-18T07:30:07.219Z (about 1 year ago)
• Topics: binary-search-tree, haskell, haskell-learning
• Language: Haskell
• Homepage:
• Size: 5.86 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: ChangeLog.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Binary Search Trees in Haskell

A simple and stupid implementation of Binary Search Trees in Haskell. The code refers the examples in the book [Learn You a Haskell for Great Good!](http://learnyouahaskell.com).