Segment Tree Min Range, is a Binary Tree related problem and in this post we will see how we can solve this challenge in C++

Segment for min range queries. Given an array A of size N, there are two types of queries on this array.

query(l, r): print the minimum in the sub-array update(x, y): arr[x] = y

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas