Data Structures Tutorial - Fenwick Trees(Binary Indexed Trees) скачать в хорошем качестве

Data Structures Tutorial - Fenwick Trees(Binary Indexed Trees)

Today I'm going to explain everything one has to know in order to master Fenwick Trees, a data structure which is not really loved by competitive programmers, but a data structure which is in my opinion really interesting. I started from the basics and I am covering everything up to the most difficult optimizations. Please give me your constructive feedback. 0:00 - Reasoning for posting a Fenwick Tree tutorial 1:51 - How do Fenwick Trees work 9:50 - Implementation 11:24 - Further clarifications about how do queries work 14:15 - Optimization for binary searching on the answer 18:45 - Building a Fenwick Tree in O(n) 20:15 - Some other examples of tasks 25:00 - Conclusions Tasks used: https://codeforces.com/edu/course/2/l... https://codeforces.com/edu/course/2/l... https://codeforces.com/edu/course/2/l... https://codeforces.com/edu/course/2/l... Submissions: https://github.com/stefdasca/Competit... POTW Playlist:    • Problem of the Week   Codeforces Problem Tutorials:    • Codeforces Problem Tutorials   Join the Discord Server:   / discord   GitHub: https://github.com/stefdasca/Competit... Codeforces: https://codeforces.com/profile/stefdasca Instagram:   / stef.dasca   If you liked the video, please like, subscribe and press the bell button in order to be the first ones to watch the next videos!