flâneur

Fenwick tree

en.wikipedia.org · 2,891 words · saved by 1 readers

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.

Fenwick tree - Wikipedia Jump to content From Wikipedia, the free encyclopedia Data structure Binary indexed tree"},"image":{"wt":"16-node Fenwick tree.svg"},"type":{"wt":"Binomial tree"},"invented_by":{"wt":"Boris Ryabko"},"invented_year":{"wt":"1989"},"space_avg":{"wt":"{{math|O(''n'')}}"},"space_worst":{"wt":"{{math|O(''n'')}}"},"search_avg":{"wt":"{{math|O(log''n'')}}"},"search_worst":{"wt":"{{math|O(log''n'')}}"},"insert_avg":{"wt":"{{math|O(log''n'')}}"},"insert_worst":{"wt":"{{math|O(log''n'')}}"}},"i":0}}]}'> Fenwick tree Binary indexed tree Type Binomial tree Invented 1989 Invented by

related reading