can you explain how to approach for query function
3 d structure fenwick tree
@nirajgusain5,
Let BIT[i][j][k] = represent cuboid ({i-2^{d_i}+1,j-2^{d_j}+1,k-2^{d_k}+1},{i,j,k}),
Now simply in both query and update, do as you do in a 1D BIT, just do to for 3 dimensions.
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.