Hello everybody!
It's been a while since I last posted a video tutorial, and since the previous one received a really positive feedback, I decided to create another tutorial. Since it's generally a data structure which isn't that loved by many competitive programmers, and it has also been suggested by many people in my Discord server, I decided to create a detailed video tutorial about Fenwick Trees.
I explained everything about Fenwick Trees, starting from basics and going all the way to the less well known optimizations, as well as explaining when Fenwick Trees are useful and why should they get more love from the community.
As always, if you have constructive feedback, please share it in comments or in the Discord server.
Thank you for watching.
Great Video! I used to black box Fenwick trees as I never properly understood the "jumping" part but you've explained it so shortly and intuitively that I finally understood it well.
I have never been able to understand Fenwick Tree updates and why they take O(log(N)) time (the jumps were very confusing) so I have always used it as a black box. I finally understood that after watching your video. Thanks for a great tutorial!