In this video i have discussed binary indexed trees data structure. The data structure is very useful for solving range queries.
Part 2 : [ Ссылка ]
Link to code : [ Ссылка ]
Follow me on below platforms for all latest updates
Facebook
[ Ссылка ]
Instagram
[ Ссылка ]
Twiitter
[ Ссылка ]
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)
