Add Segment Tree Data Structure #177
Merged
Conversation
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
senthilkumar1729
requested changes
Oct 5, 2019
Collaborator
senthilkumar1729
left a comment
senthilkumar1729
left a comment
There was a problem hiding this comment.
Can you please provide a small description of Segment Tree at the top? 😄
The code looks good 👍 Thank you for contributing!
Contributor
Author
Description has been added. |
ionicc
requested changes
Oct 8, 2019
Member
ionicc
left a comment
ionicc
left a comment
There was a problem hiding this comment.
You could add the description as a comment on the beginning of the script 😄
Contributor
Author
Description has been added in the file. |
ionicc
approved these changes
Oct 12, 2019
Member
ionicc
left a comment
ionicc
left a comment
There was a problem hiding this comment.
Great work! Thanks for your contribution 😄
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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.
Description
Segment Tree is used for storing information about intervals, or segments. It allows querying which of the stored segments contain a given point.
A segment tree for a set I of n intervals uses O(n log n) storage and can be built in O(n log n) time. Segment trees support searching for all the intervals that contain a query point in O(log n + k), k being the number of retrieved intervals or segments.
\cite{https://en.m.wikipedia.org/wiki/Segment_tree }
Fixes #82
Type of change