Add above/below functionality - #67
Merged
Merged
Conversation
VincentJ711
force-pushed
the
above-below
branch
2 times, most recently
from
February 8, 2026 17:50
5036f5c to
2cc7231
Compare
VincentJ711
force-pushed
the
above-below
branch
from
February 8, 2026 17:56
2cc7231 to
f84a96b
Compare
Owner
|
Great addition, thank you! I believe I have something like that in my other lib https://github.com/w8r/splay-tree, let me check the naming |
Owner
|
I think it's great, I'll release it. Thank you once again |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
The purpose of this PR is to facilitate search filtering in ascending/descending order of the keys. If i want to find all the nodes having keys in the range [x, y] in ascending order, then i need to find the node with key below x as the start point. Similarly, if i want to find them in descending order, i need to find the node with key above y as the starting point. Also, I should be able to do it without knowing if x or y are keys in the tree.