Segment Tree Implementation

[anirudhb11]

Is your feature request related to a problem? Please describe.
I would like to add an implementation of Segment Tree to the Data Structures collection

Describe the solution you'd like
The data structure would be implemented using an array and would support range sum and point update queries in O(logN) time. The space complexity would be O(4 * N) where N is the number of element of the array for which we would build the Segment Tree.

Additional context
It supports a variety of other operations also, like finding maximum in a range which would not be supported by Fenwick Trees. A list of operations that can be done with Segment Trees can be looked up here

As part of Hacktoberfest 2021, I would like to add this implementation, could you please assign this to me @siriak.
Thank you

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!