Algo_ds_101: Implementing Binary Indexed Tree Or Fenwick Tree | Range Queries | C++

[chiyapathak]

Submission Title

• Binary Indexed Tree

Submission Type

• Algorithm

Submission Description

• To perform query and update both in O(logN) time we use fenwick tree.
• Compared with Segment Tree, Binary Indexed Tree requires less space and is easier to implement.
• I will perform build, update, query operations to find maximum in a given range.

Submission Directory
algo_ds_101 => Data_Structures => Tree => Binary_Indexed_Tree => range_max_query_BIT.cpp

Contributors

• [x] C++ -
• [x] C -
• [ ] Python -
• [ ] Java -
• [ ] JavaScript -
• [ ] TypeScript -
• [x] Golang -
• [ ] Ruby -
• [ ] php -
• [ ] Swift -
• [ ] C# -

[github-actions[bot]]

👋 @${author}

Thanks for opening your first issue here! Be sure to follow the issue template!

Regards @ahampriyanshu :v:

[chiyapathak]

I would like to work on it.

[kugiyasan]

Can I get assigned for the python implementation please?

[kugiyasan]

Can I do the Golang implementation too?

[Amanj2000]

I would like to implement it in c.

[Amanj2000]

Can I also implement it in Java?

[ahampriyanshu]

thanks everyone :v: