Binary Indexed Tree or Fenwinck Tree

Please anyone could write a blog about BIT with definition of problem under following heads–>

  1. Updating value at an index and finding reading value applying a function for a given range
  2. Updating value at for range and finding cf upto a given index
  3. Updating value for range and querying on a range

and I already have referred
mentioned tutorials but they define either 1st or second type problems …

1 Like

This link has everything you need. (y) :slight_smile:

You may like to refer this.