Method for search nodes before and after key not found#4
Open
JoaoBaptMG wants to merge 1 commit into
Open
Conversation
…tree (something similar to C++'s lower_bound).
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
1 participant
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.
This method adds something I think is missing from most (if not all) binary search tree implementations on .NET, and is something I needed implemented.
SortedDictionarydoes not have it, neither doSortedSet.The function added
SearchLeftRight, looks for the key requested as usual. However, if it is not found, it returns (in itsoutparameters) the node values whose keys are immediately before and after the key that was requested, but not found. The specific objective I implemented this method was to be able to search for an angle in an ordered edge list from a vertex, in order to implement a doubly-connected edge list.