Tutorial: Binary Indexed Tree (Fenwick Tree)

Implementations:

I didn't liked any of the other tutorials. So I decided to make my own. Hope you like it.

[elpuri]

Needed to look up BIT and ended up here. Definitely better than the top ranked videos on the subject. Good job with the illustrations. Also a perfect pace for me.

[quantumcookie]

I've heard a lot of people say that BIT is difficult to understand... Maybe they haven't found your tutorial yet :)

[ompatel]

Incredibly well made explanation and visualization! Hats off to you bud.

[sarswataryan]

finally found a tutorial that is so clear to should be on the top of search list. Good JOB!!!!

[hshah]

One of the best explanation for binary indexed tree, i've come across so far.

[rayxr]

Dude, you clutched tf out of this explanation. The way my professor did this was so unnecessarily confusing after seeing this. Great job.

[allanlago]

It is hard to find a good tutorial about computer science on youtube, but this one is it. Very good job

[onurcanisler]

*Hats off for this incredible teacher.*

[CorpusGigantus]

14:18 If you are using 1-indexed arrays I believe the "while idx < len(bit_arr)" should be "while idx <= len(bit_arr)". E.g., if len=16, idx = 16 is valid but would be discarded by your check in the while-loop. Also, you may want to add to the implementation notes that getting the value of a specific array index is a special case of RANGE_SUM(i, j), namely GET(i) = RANGE_SUM(i, i).

[commentator]

i dont usually is so crystal clear explaination even for beginners.... thank u

[chaitanyagawande]

very insightful and helpful tutorial in understanding Fenwick in a clear way. Thank you for your efforts.

[indigoturtle]

I'm pretty sure x & (x-1) also works for the bit-wise operation, and its easier!

[Evcurik]

Really good tutorial, I suppose the others want to gain more watches by making the videos so poor, you have to watch them again and again, but yours was good enough to get the subject for the first time :D Would be great if you do the AVL or black/red tree tutorial, these are very poorly made :D Thanks a lot ;)

[ashutoshaswal]

Best Explanation I Ever Found About BIT!
Thank You Sir!

[sumitb]

I don't think BIT could be explained in any way better than this. Thanks a lot!

[pushkarsoni]

This is Exactly What I need, Thank you .. Does anyone Know some other Tutorials for other topics where explanation is this very good cuz these kind of videos are hard to find.

[tonywen]

Very good and clear explanation of how BIT works and why it works.

[competitivecoding]

Absolute masterpiece .Can't stress enough about how good this tutorial is .Thank you so much!

[YeGaogaosanyong]

Great tutorial. I think I finally understand how Fenwick tree works under the hood. Big thanks!

[pavanputhra]

Best I have found so far on Binary Index Tree. I could understand in one go