Tutorial: Binary Indexed Tree (Fenwick Tree)

[@dakshays6375]

Best explanation of BIT on KZbin

[@elpuri2]

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.

[@adityamantri7828]

Yeah you're welcome sissy!

[@hshah8831]

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

[@ompatel8091]

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

[@sarswataryan59]

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

[@rayxr]

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

[@allanlago1]

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

[@commentator2407]

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

[@CorpusGigantus]

14:18 If you are using 1-indexed arrays I believe the "while idx < len(bit_arr)" should be "while idx

[@gsscala]

thought the same thing about

[@onurcanisler]

*Hats off for this incredible teacher.*

[@quantumcookie64]

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

[@jalgs4210]

+Sethu Kumar Great to hear. Thanks a bunch.

[@adityamantri7828]

Or mine big guy

[@ashutoshaswal]

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

[@chaitanyagawande855]

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

[@YeGaogaosanyong]

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

[@sumit6b]

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

[@christinehill4491]

This is a very good tutorial. It should be the highest rated BIT tutorial.

[@tonywen7412]

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

[@pavanputhra]

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

[@competitivecoding9965]

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

[@adityamantri7828]

No problem buddy!

[@dineshraj5957]

best explanation I have found so far!

[@ilikememes9052]

Thanks for this video explanation, I always lookup for videos which explains concepts behind them. I saw many videos on this topic "Fenwick Trees" but they teach theory only. Finally, After a long way through watching videos I came on this video. Definetly deserves my Like. Cheers

[@narasimhaswamy5464]

This was so perfect that anyone can understood in one go.

[@diwu689]

This was the best explanation of BIT that I found on youtube!

[@eldarahmadov1275]

I cannot thank you enough for making this crystal clear! Great job!

[@omarkhaled-os2wv]

Way to go ! it is a very good tutorial. It is the best tutorial of Binary indexed tree I watched before. Really other tutorials are terrible comparing to yours.

[@adityamantri7828]

Other than mine

[@pushkarsoni8927]

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.

[@stablesort]

I agree, this is an excellent tutorial. For other topics, including a different angle on visualizing Fenwick Trees, try: kzbin.info/www/bejne/Y5zIlYSqZ7qgpKc

[@shankhashubhramukherjee3585]

amazing video...such a clear and visual approach to understand....

[@xyzhang6053]

Although the accent is not the best, but the content is supreme.

[@davidmuk9871]

Nice tutorial! I come across this BIT structure by accident, didn't know there's such a efficient tree

[@indigoturtle5234]

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

[@pushkarsoni8927]

it removes the last bit but how to add to last bit?

[@adityamantri7828]

NO IT DOESN'T. DON'T DROP OUT OF SCHOOL KIDS OR YOU'LL TURN OUT LIKE THIS GUY

[@wsss6088]

Better than the rank 1 video in KZbin search. Thank you!

[@pushkarsoni8927]

Hey, do you compete in HackerEarth?

[@adityamantri7828]

You're welcome!

[@Ruddradev]

This was very nice Jack. I thoroughly enjoyed the simple way you explained this topic.

[@adityamantri7828]

Oh haha, thank you! *Blushes*

[@yiyang4368]

No doubt it's the best tutorial on Binary Indexed Tree! Thank you so much!

[@adityamantri7828]

You're welcome kid!

[@yaswanthchunduru5298]

The awesome lecture that I hed has ever seen, Thanks

[@xenowits]

too good explanation!!Perfect hats off dude clarity of concepts is mindblowing

[@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 ;)

[@arpit35007]

+Eva Nedeliaková The exact thing cam to my mind.

[@adityamantri7828]

Thanks, I know I do a lot for the community

[@jkinsella]

Phenomenal explanation. Looking forward to more algorithm vids

[@ezizdurdyyev3813]

the best explanation so far!!!

[@tofrom8541]

Very awesome and nice explanation .

[@092fariaafrin7]

Simply Awesome!! 💜💜

[@stablesort]

Very well done!

[@WangYangX]

Very intuitive explanation of BIT

[@ojasgupta1454]

Really good explanation

[@xfw1030]

by far the best explanation. thank you !

[@nipulsindwani117]

That was really amazing, understood in one go

[@josevillegas2721]

You can also clear the last set bit of x by doing x = x & (x-1)

[@SharatS]

Great illustrations on the video. Made it easy to understand :)

[@aftabulislam592]

Very simple and easy to understand tutorial. Thanks

[@purnima_2]

Best video tutorial for fenwick tree. Thanks a lot

[@fernandogabrieli2915]

thank you for this video! it was very helpful to me

[@sahil8565]

Great Video! Please upload more like these !

[@arjundas1830]

good job.. This is very good, great illustrations.

[@ankitbansal2303]

Great Explanation

[@siddharthgaur7919]

Nice illustration!!

[@B0JACK]

Great job with this

[@esrefozdq]

Nice tutorial with clear explanations.

[@CSERohitKartik]

very clear and precise!

[@yangli6597]

It's a great tutorial i had seen of BIT. But I found a little typo at 9:39 which we need to from position 6 to position 4, so we need to take the last set bit 1 flip to zero. The binary representation of 6 is 0110, convert to 4 which is 0100. So did you say in the video "0110 which is 6 and we flip the last set bit again ane we end up with 1011" is wrong? Did you want to say "we end up with 0100"?

[@johannesginthaburg8954]

Can someone explain why we need to do x & -x? isn't this just 1? why not just do index + 1, index -1. to get the next or parent respectively?

[@yusizhang8083]

It is trying to get the **rightmost** "1" in the bit. Say in memory we represent integer using 8bits(for the simplicity), so that if the idx is integer 8, which will be (00001000). Then -idx will be (111101111) + 1(flip every bit and add 1), which is (11111000). Now if you do "&"(AND) operation, you will get (00001000). This is what you want eventually, the **rightmost** "1" in the bit.

[@johannesginthaburg8954]

Yusi Zhang wow, you just blew my mind. thanks for taking the time to comment.

[@rajeshmanchikanti6733]

It was very good explaination

[@jasonl207]

thank you very much! finally I understand how it is constructed

[@valvakar1622]

Very nicely explained, thanks!

[@vishnuvardhan623]

very precise loved it

[@_thehunter_]

thanks for making this video, it was really helpful...

[@ArjunTanwar900]

why dont you make more videos on algorithms, you explain things really well

[@yyl3683]

Great explanation! Thanks!

[@RaviChoudhary_iitkgp]

thanks for simple and elegant explanation...

[@seyoungj]

Thank you a lot. Well explained and easy to understand!

[@lingyongwang2817]

Great Video!

[@GusGusCastelanos1997]

Great video man!

[@minecroft]

thanks for your time and this great video 👍🏻

[@akhilkaushik7348]

Good Tutorial. Keep it up !

[@SonuSonu-tk5pk]

amazing explanation thanks for the video

[@rockgitmo]

Very good tutorial!

[@santanabas]

brilliant explanation

[@kalhou2145]

excellent explanation! thanks!

[@xiaoranlr]

Great tutorial!

[@nzjaunnoo6030]

Wonderful! Thank you so much.

[@21scars66]

dis right here is d goddamn treasure!

[@story_time_43]

thanks a lot, really good tutorial

[@arpit35007]

Really nice video

[@momo57563]

Great Video!!!

[@EalhamAlMusabbir]

Thanks a lot for the nice tutorial... :)

[@xiqiruan2848]

omg finally I understood it!

[@user-wc1sm8cj8s]

not sure if this is an ASMR Fenwick tree video or what. Just kidding

[@testshar2117]

9:37 - Did you say 1011 is 4? That's wrong.

[@vetiarvind]

i don't really get it alas

[@cedricchen6946]

So much thanks!!!!!

[@AmanKumar-gq7li]

nice video .Thanks.

[@lynnjohn915]

x & (x-1) also works

[@hyperbola_cc]

Good instruction

[@dejavukun]

Thanks a lot man!

[@AtulkumarGupta080796]

excellent bro

[@graciagarcia482]

THANK YOU VERY MUCH

[@evertonalbuquerque3623]

*thank you*

[@ashugarg3196]

please upload video on trie

[@chak-pongchung8463]

After all, Binary Indexed Tree is actually not "binary tree", it is just the index which makes use of the binary representation? I dont quite see any binary tree shape here in the video.

[@jalgs4210]

+Chak-Pong Chung Yes, you are correct. BIT is no binary tree. (a Segment tree would be a binary tree)

[@VBeniwal_IITKGP]

Thanks bro!!!

[@ShubhamJoshishubhamjoshi]

Thanks a lot.

[@adilmahmood9098]

two minutes of silence for people who have disliked

[@xenowits]

they must die