Sum of given range | Segment Tree | Set 1 | GeeksforGeeks

Soundtrack: Dream Yourself Smooth by Puddle of Infinity

Please Like, Comment and Share the Video among your friends.

Also, Subscribe if you haven't already! :)

[siddhartharay]

Hi. The video is really great. I liked the animation based presentation of it. Sometimes when you don't want any specific lecture on the topic because you have already covered the theory and you simply want to revisit the working of the algorithm, just a clean animation does the work without much explanation and details. So this type of content is useful for having a crisp and short revision.
I found people are complaining over why it's not a voice video, I think a voice video is helpful when you are either covering the topic first time, or you want a detailed explanation to revise the content.
Its preferential and need based. So both the types should be appreciated.

[umangjain]

This is awesome, this is the best one can get in 3 minutes.

[Sulerhy]

Great explanation. Anyways the sound of the video scared me like segment tree in the real interview :)))😂

[prestonbui]

The music is so creepy. Nice video though :)

[funkiekeda]

Great video, thanks a lot. I too would have preferred a vocal video but I do understand that it adds a lot of work to the producer and they might simply haven't got time for that.

[kachineniharivarunavi]

This video is really nice. I implemented the code in parallel while watching the video and I felt it quite easy. No fear of range-based query problems now. 🥳🥳🥳🥳🥳🥳Thank you GFG

[elliotho]

Excellent video! Really clear and succinct video :) Thank a lot

[krishnarao]

can anybody tell me what should i add into the code to make my tree visible

[ahzong]

Err excuse me, I have a little problem:
To 1)find the sum of given range from index l to r or 2)change value of a specific element to x, why do we need to find the minimum element in a given range? These three operations seem to have no connections to each other at all so it kind of makes me very confused...
For me, to achieve 1) what I'll do is make a sum variable then use a loop to collect the answer, and to achieve 2) I can simply say arr[i] = x as the video mentioned.

Basically, I just can't figure out how is the solution even connected to the problem...
Any help is appreciated, thanks.

[blalmala]

does this example obey the complete binary tree rules?

[andreig]

Great and intuitive video! Thanks for the help! :)

[jianingzhuang]

Perfect video! (Except for the music).

[santhoshcts]

As always I mention, why this sound track ? its as good as me reading the article and listening to my Spotify playlist, the intent of watching this video is killed . I observed all the advanced data structures videos from geeks for geeks are having this kind of sound tracks ? why ? is it hard to explain ? I saw people explaining "Finding difference of two numbers or find sum of 2 numbers with 9 mins length time  " ( its great for beginners, I wont comment on it but that can be avoided but don't skip these important adv DS concepts where many people don't know or find it hard to understand ) but if you don't start explaining the complex algo's or complex data structures, it wont help others .

thanks, sunny

[sonali]

Good video, but I would prefer a vocal video

[DL-rwfw]

Like the video. Hate the useless and annoying sound.