Red-black tree implementation augmented to efficiently calculate the sum of arbitrary functions for elements smaller than a given key (similarly to an order statistic tree). Based on the original implementation by Emin Martinian available at http://web.mit.edu/~emin/www.old/source_code/red_black_tree/index.html
-
Notifications
You must be signed in to change notification settings - Fork 0
Red-black tree implementation augmented to efficiently calculate the sum of arbitrary functions for elements smaller than a given key (similarly to an order statistic tree). Based on the original implementation by Emin Martinian available at http://web.mit.edu/~emin/www.old/source_code/red_black_tree/index.html
License
dkondor/rbtree
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
Red-black tree implementation augmented to efficiently calculate the sum of arbitrary functions for elements smaller than a given key (similarly to an order statistic tree). Based on the original implementation by Emin Martinian available at http://web.mit.edu/~emin/www.old/source_code/red_black_tree/index.html
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published