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.

Sign up for GitHub

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

Jump to bottom

Added Binary Indexed Tree resources #11

Merged
merged 2 commits into from
Oct 30, 2016
Merged

Added Binary Indexed Tree resources #11

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
08a1958
Added Binary Indexed Tree resources
sks147 Oct 30, 2016
b454a00
Added to topics list
sks147 Oct 30, 2016
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Added to topics list
  • Loading branch information
@sks147
sks147 committed Oct 30, 2016
commit b454a00b60fb7edee3233fa50c2ab62daf2d9003
3 changes: 2 additions & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,6 +14,7 @@ Topics
- [Matrix Exponentiation](#matrix-exponentiation)
- [Miscellaneous](#miscellaneous)
- [Prefix and Suffix Trees](#prefix-and-suffix-trees)
- [Binary Indexed Trees](#binary-indexed-trees)
- [Segment Trees](#segment-trees)
- [Trees](#trees)

Expand Down Expand Up @@ -187,7 +188,7 @@ Topics
- [Another problem on Codechef](https://www.codechef.com/SEPT13/problems/TMP01)
- [A2oj](http://a2oj.com/Category.jsp?ID=49)

## Binary Indexed Tree
## Binary Indexed Trees
---
*A Fenwick tree or binary indexed tree is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.*

Expand Down