Haskell SortedSet and SortedMap based on 2-3trees with node deletion marks
(2-3tree: uniform root-to-leaves tree height)
insert O(log n) delete O(log n)
the clean function rebuilds the tree giving up the deleted nodes
-
Notifications
You must be signed in to change notification settings - Fork 0
Haskell 2-3tree based sortedSet and sortedMap
License
griba2001/tree23-map-set
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Haskell 2-3tree based sortedSet and sortedMap
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published