🌲 Segment Tree Sum Queries Library 🌲

[Rohit-Yadav-Official]

Welcome to the Segment Tree Sum Queries open-source project on GitHub!

Description: This project aims to provide a robust and efficient implementation of a segment tree for handling sum queries on an array. Segment trees are powerful data structures that excel in solving range-based queries on arrays, making them suitable for a variety of applications.

Features:

Sum Queries: Quickly compute the sum of elements in a given range. Update Operations: Efficiently modify individual elements and update the segment tree accordingly. Easy Integration: Simple to integrate into your projects for efficient range-based computations.

PR Checklist:

• [x] My submission is formatted according to the guidelines in the contributing guide
• [x] My addition is on refer on the language README.md file
• [x] My addition does not have a spelling problem
• [x] My submission has a proper and user-friendly description of the algorithm
• [x] My submission has the time complexity of the algorithm
• [x] My submission has sample input-output of the program (NOT FOR PYTHON)

What kind of change does this PR introduce? (check at least one)

• [x] Bugfix
• [x] New algorithm
• [x] Optimization in previous algorithms
• [x] Code style update
• [x] Refactor
• [x] Documentation
• [x] Other, please describe:

Briefly describe the changes in this PR

Other information:

[welcome[bot]]

Thanks for opening this pull request! Please check out our contributing guidelines.