Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

SEGMENT TREE (Min, Max and Sum) #536

Open
adty2024 opened this issue Oct 3, 2023 · 0 comments
Open

SEGMENT TREE (Min, Max and Sum) #536

adty2024 opened this issue Oct 3, 2023 · 0 comments

Comments

@adty2024
Copy link

adty2024 commented Oct 3, 2023

I would like to add the complete implementation of segment tree in java.

A segment tree is a fundamental data structure for efficient range queries and updates in an array. Its key features include a hierarchical structure where each node represents a specific range of elements in the array, enabling logarithmic-time queries for a wide range of operations such as finding sums, minimums, or maximums within a given range.

@ShubhamNagure ShubhamNagure mentioned this issue Oct 3, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant