Fenwick tree
id:
fenwick-tree-187-17181410
title:
Fenwick tree
text:
A Fenwick tree or binary indexed tree (BIT) is a data structure that can efficiently update values and calculate prefix sums in an array of values. This structure was proposed by Boris Ryabko in 1989
with a further modification published in 1992.
It has subsequently become known under the name Fenwick tree after Peter Fenwick, who described this structure in his 1994 article. When compared with a flat array of values, the Fenwick tree achieves a much better balance between two operations: value
brand slug:
wiki
category slug:
encyclopedia
description:
Data structure
original url:
https://en.wikipedia.org/wiki/Fenwick_tree
date created:
2009-05-15T06:45:19Z
date modified:
2024-09-08T17:10:07Z
main entity:
{"identifier":"Q1276370","url":"https://www.wikidata.org/entity/Q1276370"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/70/16-node_Fenwick_tree.svg","width":893,"height":503}
fields total:
13
integrity:
16