Segment Tree Range Minimum Query

Create and query for minimum in segment tree

[MrEmin]

3 years ago I got job offer from Amazon because of this video, thanks Tushar.

[AnkitSharma-dxyy]

I don't really know why people do not recommend this guy's videos. This is such a gem of a channel

[DenisG]

The BEST! I tried to understand the segment tree explanation from wiki and code forces but I just didn't get it. You made it so easy to understand!!!
Thank you!

[TheGamerGuy]

i love how you always explain the recursion as well with a well labeled table...makes things very easy.

[iamamritjha]

Amazingly explained!! Clearly, the best introductory video available on segment trees as per me. Thank you Sir!

[nvjrane]

I used to think segment trees is some abstract concept. You have made it so easy. Thanks a ton!

[jahirulislammonir]

My heartiest thanks to you man, , , Your recursion explanation is one of the finest part of this video... Carry on :)

[sammy-zosl]

I have improved my coding a lot from your videos. Keep up the great work

[oshogarg]

best explaination of segment tree on Youtube, we need people like you.

[shashankrajholavanalli]

Awesome job. Very well done. Never seen a recursive function explanation so precise.

[anyu]

You got a talent of teaching. I have watched your video for kmp and segment tree, and you explained so clearly and so easy to understand.

[SEProductions]

Many thanks for this, great and easy to understand explanation, and everything was very well-made, including subtitles and everything else. Thank you for helping us, expecting nothing in return. Cheers

[pranavganorkar]

Best video in Youtube on Segment Tree...Understood it Perfectly...!!! Many

[killerthoughts]

the only man on the internet to nail this explanation

[dm_kvl]

great explanation, thanks a lot. the only thing I'd like to point out is the way the middle element is calculated. Instead, I would count it like this (high - low) / 2 + low

[meganlee]

Several interesting points related to segment tree worth chewing 1) how to calculate a ceiling number of power of 2. 2) why exactly worst case is 4 times lgn 3) how to do updates of the tree corresponding to update/append/deletion in original array

[gauravjha]

Best Video on Segment Tree....I understood the concept so clearly just because of you...Thanks you so much Sir

[vishalsheth]

Best explanation! I will join the chorus to request a video on lazy propagation techniques.Lots of competitive programmers will appreciate it!

[naughtyrishan]

Thanks a lot. Please keep uploading such videos. You help many. Your explanation along with the codes line by line really helps a lot in actual implementation. Thanks again.

[yashagrawal]

at 25:11 you said it wrong when there is complete overlap and we return segTree[pos] where pos=4 and value is 2 so returning value should be 2 but you said it 4 !! Let me know if i m wrong.