Binary Indexed Trees / Fenwick Trees made easy | Part 1
In this video i have discussed binary indexed trees data structure. The data structure is very useful for solving range queries.
Part 2 : • Range Sum Query and Inversion Count Using ...
Link to code : https://github.com/luvk1412/youtube_c...
Follow me on below platforms for all latest updates
Facebook
/ luvk1412
Instagram
/ i._m_.luv
Twiitter
/ luvk1412
Hashtag : #trees #fenwick #rangesum #binaryindexed #competitivecoding #interviewpreparation
Use Case : (0:00)
Finding right most set bit : (1:35)
Finding Sum uptill ith index : (6:13)
Updating values in BIT : (14:10)
Part 2 : (20:47)