Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Data Structure] Fenwick Tree [Java] #218

Closed
SnowyCoder opened this issue Oct 3, 2018 · 1 comment
Closed

[Data Structure] Fenwick Tree [Java] #218

SnowyCoder opened this issue Oct 3, 2018 · 1 comment

Comments

@SnowyCoder
Copy link
Contributor

The FenwickTree is a data structure for O(log(n)) updates and queries that answers both point-update and range-query questions, find out more here: https://en.wikipedia.org/wiki/Fenwick_tree
It would be nice to have this data structure implemented in Java (that is used a lot in programming contexts)

@sangamcse
Copy link
Member

GitMate.io thinks possibly related issues are #214 ([Data Structure] Fenwick Tree [CPP]), #49 ([Data Structure] AVL Tree [Java]), #52 ([Data Structure] Binary Search Tree [Java]), #57 ([Data Structure] Queue [Java]), and #56 ([Data Structure] Queue [C]).

sangamcse pushed a commit that referenced this issue Oct 18, 2018
This adds Fenwick Data Structure which can update
an element of a list and query the sum of any range
of it in only O(log(N)) time complexity.

Closes #218
sangamcse pushed a commit that referenced this issue Oct 18, 2018
This adds Fenwick Data Structure which can update
an element of a list and query the sum of any range
of it in only O(log(N)) time complexity.

Closes #218
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants