Implementation of Binary Index Tree (BIT tree) or fenwick tree for fast searching of range queries in O(log(n)) time

dsc-gtbit / HACKTOBERFEST21-GTBIT-COMPETITIVE

This repository is for all participants who wants to contribute to hacktoberfest 2021 with competitive programming questions.

2 stars 37 forks source link

Implementation of Binary Index Tree (BIT tree) or fenwick tree for fast searching of range queries in O(log(n)) time #6

Closed rishabh0906 closed 2 years ago

mridul8920 commented 2 years ago

Issue has been assigned to you. You have to contribute ques from Love Babbar's Sheet And This is not the part of the sheet so you can simply make a separate folder stating Extra Imp ques of Binary Tree and can add this over their.