red_black_tree
red_black_tree copied to clipboard
Add range function
Add range(min, max\\nil) function to return all keys from min to max. Based on the properties of RBTrees, we should be able to find the start and end nodes in 2log(n), though rebuilding the new tree would likely take nlog(n) time.
Required for https://github.com/SenecaSystems/sorted_set/issues/7
I need to be able to:
- [ ] Navigate to a start node
- [ ] Reduce until I reach a finish node
- [ ] Halt reduce once that node is reached (as opposed to just no-opping through the rest of them)