Hello, today I'll post a implementation of a Segment Tree which fits for Range Minimum Query.
I've been studying segment trees about a time, and I'm starting to understand them now, this implementation runs in O(N) for construction and O(log(N)) for query and update.
Another things is that the source code of the post is stored in a Github Gist
