fastest implementation of segment tree

Someone please post or suggest some link to what could be the fastest implementation of simple range minimum query segment tree in C/C++ ?

1 Like


The one I know builds tree in linear time O(n) and query is processed in logarithmic time O(logn).
You want it faster?


Any implementation has that.But for Range update in O(log n) time u wud have to use lazy propagation.Code-


thankz sparsh…that proves to be really helpful

I wrote a tutorial on Lazy Updates. Let me know if you have any more questions.
Good luck!

1 Like

refer here:

“Page cannot be displayed”, it says :frowning:

1 Like