Updates in BIT trees

At 3:15 , how come every element is updated by +v. In the previous lectures we were taught that only those elements are updated which satisfy this relation :- i+= (i&(-i)) ??

You are getting it wrong. You are not clear with How the nodes store elements. Please watch carefully again.

For eg.
BIT[6] doesn’t mean 6th node. BIT[8] doesn’t mean 8th node.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.