Fenwick tree

Fenwick tree Binary indexed tree
Type	Binomial tree
Invented	1989
Invented by	Boris Ryabko
Time complexity in big O notation Operation Average Worst case Search O(logn) O(logn) Insert O(logn) O(logn) Space complexity Space O(n) O(n)

A Fenwick tree or binary indexed tree (BIT) is a data structure that stores an array of values and can efficiently compute prefix sums of the values and update the values. It also supports an efficient rank-search operation for finding the longest prefix whose sum is no more than a specified value. Its primary use is operating on the cumulative distribution function of a statistical frequency table which is updated often.

This structure was proposed by Boris Ryabko in 1989[1] with a further modification published in 1992.[2] It has subsequently become known under the name Fenwick tree after Peter Fenwick, who described this structure in his 1994 article.[3]

A simple array of values is trivial (constant-time) to update but requires ${\displaystyle O(n)}$ time to compute a prefix sum or search for a prefix length.

An array of prefix sums can return a prefix sum in constant time, and search for a prefix length in ${\displaystyle O(\log n)}$ time, but requires ${\displaystyle O(n)}$ time to update one of the values.

A Fenwick tree allows all three operations to be performed in ${\displaystyle O(\log n)}$ time. This is achieved by representing the values as a tree with ${\displaystyle n+1}$ nodes each node in the tree stores the sum of the values from the index of its parent (exclusive) up to the index of the node (inclusive). The tree itself is implicit and can be stored as an array of ${\displaystyle n}$ values, with the implicit root node omitted from the array. The tree structure allows the operations of value retrieval, value update, prefix sum, and range sum to be performed using only ${\displaystyle O(\log n)}$ node accesses.

Motivation

Main article: Prefix sums § Applications

Given an array of values, it is sometimes desirable to calculate the running total of values up to each index according to some associative binary operation (addition on integers being by far the most common). Fenwick trees provide a method to query the running total at any index, or prefix sum, while allowing changes to the underlying value array and having all further queries reflect those changes.

Fenwick trees are particularly designed to implement the arithmetic coding algorithm, which maintains counts of each symbol produced and needs to convert those to the cumulative probability of a symbol less than a given symbol. Development of operations it supports were primarily motivated by use in that case.^[citation needed]

Description

A Fenwick tree is an implicit tree where nodes are consecutively numbered, and parent-child relationships are determined by arithmetic on the node indexes.

An important function in this index arithmetic is the least significant set bit, also called the find first set operation. This is the greatest power of two which divides an index ${\displaystyle i}$. This is the power of two (1, 2, 4, 8, ...) and not the exponent (0, 1, 2, 3, ...). It can be efficiently computed in two's complement arithmetic as ${\displaystyle \operatorname {lsb} (i)=i\mathbin {\&} -i}$ (where & denotes bitwise AND).

A Fenwick tree is most easily understood using a one-based array ${\displaystyle A[n]}$ with ${\displaystyle n}$ values. Using half-open interval syntax, let ${\displaystyle A(i,j]=\{A[k]\}_{k=i+1}^{j},}$ the range from ${\displaystyle i}$ (exclusive) to ${\displaystyle j}$ (inclusive). The corresponding Fenwick array ${\displaystyle F[n]}$ stores the range sums ${\displaystyle \textstyle F[i]=\sum A(i-\operatorname {lsb} (i),i]}$. That is, the sum of ${\displaystyle \operatorname {lsb} (i)}$ values ending with and including ${\displaystyle A[i]}$.

A fictitious node 0 is used in some descriptions, but is never actually accessed and need not be explicitly stored. ${\displaystyle \operatorname {lsb} (0)=\infty ,}$ but the value is never actually needed. ${\displaystyle F[0]}$ may be considered to contain the sum of the empty range ${\displaystyle A(0,0]=\{\}}$ with value 0.

A "Fenwick tree" is actually three implicit trees over the same array: the interrogation tree used for translating indexes to prefix sums, the update tree used for updating elements, and the search tree for translating prefix sums to indexes (rank queries).[4] The first two are normally walked upwards, while the third is usually walked downwards.

The interrogation tree

The interrogation tree is defined so that the parent of node ${\displaystyle i}$ is ${\displaystyle i-\operatorname {lsb} (i)=i\mathbin {\&} (i-1)}$. For example, the parent of 6 = 110₂ is 4 = 100₂. Implicit node 0 is the root.

Each level ${\displaystyle k}$ of the tree contains nodes with indices corresponding to sums of ${\displaystyle k}$ distinct powers of 2 (with ${\displaystyle k=0}$ representing an empty sum 0). For example, level ${\displaystyle k=1}$ contains nodes ${\displaystyle 1=2^{0},2=2^{1},4=2^{2},...}$ and level ${\displaystyle k=2}$ contains nodes ${\displaystyle 3=2^{1}+2^{0},5=2^{2}+2^{0},6=2^{2}+2^{1},...}$

Node ${\displaystyle i}$ has ${\displaystyle \log _{2}(\operatorname {lsb} (i))}$ children (${\displaystyle i+1,i+2,i+4,...,i+\operatorname {lsb} (i)/2}$), and ${\displaystyle \operatorname {lsb} (i)}$ total descendants. (These numbers include nodes greater than ${\displaystyle n}$, which are omitted and never accessed.)

The below diagram shows the structure of a 16-node Fenwick tree's interrogation tree, including the root, so it corresponds to a 15-element array A:

Depiction of a 16-node Fenwick interrogation tree containing range sums of a 15-node array A

To find the prefix sum ${\displaystyle A[1]+\cdots +A[i]}$, sum the values in ${\displaystyle i}$, its parent, its parent's parent, and so on up to (but not including) the root. To compute a range sum ${\displaystyle A[i]+\cdots +A[j]}$, subtract the prefix sums for ${\displaystyle i-1}$ and ${\displaystyle j}$.

This can be optimized by stopping at their first common ancestor. An extreme example is asking for a single entry ${\displaystyle A[j]}$. In this case, the common ancestor of ${\displaystyle j}$ and ${\displaystyle i=j-1}$ is ${\displaystyle j-\operatorname {lsb} (j)}$, so start with ${\displaystyle F[j]}$ and then, as long as ${\displaystyle i\neq j-\operatorname {lsb} (j)}$, subtract ${\displaystyle F[i]}$ and update i := i - lsb(i).

The update tree

The update tree is the mirror image of the interrogation tree. The parent of node ${\displaystyle i}$ is ${\displaystyle i+\operatorname {lsb} (i)=(i\mathbin {|} (i-1))+1}$ (where | denotes bitwise OR). For example, the parent of 6 = 110₂ is 8 = 1000₂.

This conceptual tree is infinite, but only the part with indexes up to ${\displaystyle n}$ is stored or used. Excluding the fictitious nodes with indexes greater than ${\displaystyle n}$ it will be a forest of disjoint trees, one for each bit set in the binary representation of ${\displaystyle n}$.

Here, a node's ancestors are all nodes whose range sums include its own. For example, ${\displaystyle F[6]}$ holds the sum of ${\displaystyle A(4,6]}$, ${\displaystyle F[8]}$ holds the sum of ${\displaystyle A(0,8]}$, and so on.

To modify one of the values ${\displaystyle A[i]}$, add the change to ${\displaystyle F[i]}$, then ${\displaystyle i}$'s parent, then its grandparent, and so on, until the index exceeds ${\displaystyle n}$.

The search tree

Unlike the other two trees, the search tree is a binary tree, arranged in an order Knuth calls a "sideways heap".[5] Each node is assigned a height equal to the number of trailing zeros in the binary representation of its index, with the parent and children being the numerically closest index(es) of the adjacent height. Nodes with odd indexes (${\displaystyle \operatorname {lsb} (i)=1}$) are leaves. Nodes with even indexes have the closest two nodes of the next-lowest index as children, ${\displaystyle i\pm \operatorname {lsb} (i)/2}$. Node ${\displaystyle i}$'s parent in the search tree is ${\displaystyle (i-\operatorname {lsb} (i))\mathbin {|} (2\cdot \operatorname {lsb} (i))}$.

For example, the children of 6 = 110₂ are 5 = 101₂ and 7 = 111₂, and its parent is 4 = 100₂.

Although this tree is potentially infinite, we may define its root to be the highest existing node, whose index is the greatest power of 2 less than or equal to ${\displaystyle n}$.

It is possible for a node to have a fictitious parent with an index greater than ${\displaystyle n}$ yet still have an existing grandparent. If the example above applied to a 5-node tree, then node 5 would have a fictitious parent 6, but an existing grandparent 4.

The search tree may be considered a combination of the previous two trees. A node's left subtree contains all of its descendants in the update tree, while its right subtree contains all of its descendants in the interrogation tree. A node's parent in the search tree is either its interrogation or update parent (depending on whether the node is a right or left child, respectively), and the other type of parent may be found by multiple upward steps in the search tree.

However, upward traversals in the search tree are uncommon; its primary use is to perform rank queries: given a prefix sum, at what index does it appear? This is done by a downward traversal through the search tree. During the traversal, three variables are maintained: The current node's index, the rank being sought in the subtree rooted at the current node, and a "fallback index" to be returned if the rank sought is greater than can be found in the subtree.

Initially, the current node is the root, the rank sought is the original query, and the fallback index is a special "overflow" value indicating that the rank is not in the tree. (Depending on the application, ${\displaystyle 0}$ or ${\displaystyle n+1}$ might be used for this purpose.)

Each step, either the current node is a fictitious node (index greater than ${\displaystyle n}$), or we must decide if the position sought is to the left or right of the end of the current node. If the rank sought is less than the Fenwick array value ${\displaystyle F[i]}$ for the current node, we must search its left subtree. If it is greater, search its right subtree. If it is equal, the direction chosen depends on how you wish to handle searches for sums lying exactly between two nodes.

These three possibilities are then further divided based on whether the current node is a leaf or not:

• If the current node is a leaf and:
  • the target is in its (empty) left subtree, return the current index.
  • it is fictitious or the target is in its right subtree, return the fallback index.
• If the current node is not a leaf and:
  • it is fictitious, search for the same rank in its left subtree with an unchanged fallback index.
  • the target is in its left subtree, search for the same rank in its left subtree with the current index as the fallback index.
  • the target is in its right subtree, search for the target rank minus the current node's value in the right subtree, with an unchanged fallback index.

Pseudocode

A simple pseudocode implementation of the two main operations on a Fenwick tree—query and update—is as following:

function query(tree, index) is
    sum := 0
    while index > 0 do
        sum += tree[index]
        index -= lsb(index)
    return sum

function update(tree, index, value) is
    while index < size(tree) do
        tree[index] += value
        index += lsb(index)

The function ${\displaystyle {\text{lsb}}(n)}$ computes the least significant 1-⁠bit or last set bit of the given ${\displaystyle n}$ or, equivalently, the largest power of two that is also a divisor of ${\displaystyle n}$. For example, ${\displaystyle {\text{lsb}}(20)=4}$, as shown in its binary representation: ${\displaystyle {\text{lsb}}(10{\textbf {1}}00_{2})=100_{2}=4}$. This function can be simply implemented in code through a bitwise AND operation: lsb(n) = n & (-n), assuming two's complement negation.[3]

Construction

One naïve algorithm to construct a Fenwick tree consists of initializing the tree with null values and updating each index individually. This solution works in ${\displaystyle O(n\log {n})}$ time, but an ${\displaystyle O(n)}$ construction is possible:[6]

function construct(values) is
    tree := values
    for index from 1 to size(tree) do
        parentIndex := index + lsb(index)
        if parentIndex ≤ size(tree) then
            tree[parentIndex] += tree[index]
    return tree

See also

• Order statistic tree
• Prefix sums
• Segment tree

References

1. Boris Ryabko (1989). "A fast on-line code" (PDF). Soviet Math. Dokl. 39 (3): 533–537. Archived (PDF) from the original on 2019-07-17. Retrieved 2019-07-17.
2. Boris Ryabko (1992). "A fast on-line adaptive code" (PDF). IEEE Transactions on Information Theory. 28 (1): 1400–1404. Archived (PDF) from the original on 2019-07-14. Retrieved 2019-07-14.
3. Peter M. Fenwick (1994). "A new data structure for cumulative frequency tables". Software: Practice and Experience. 24 (3): 327–336. CiteSeerX 10.1.1.14.8917. doi:10.1002/spe.4380240306. S2CID 7519761.
4. Marchini, Stefano; Vigna, Sebastiano (14 October 2019). "Compact Fenwick trees for dynamic ranking and selection". arXiv:1904.12370 [cs.DS]. Extensive discussion of practical implementation details.
5. Knuth, Donald (2011). Combinatorial Algorithms, Part 1. The Art of Computer Programming. Vol. 4A. Upper Saddle River, NJ: Addison-Wesley Professional. pp. 164–165.
6. Halim, Steven; Halim, Felix; Effendy, Suhendry (3 December 2018). Competitive Programming 4. Vol. 1. Lulu Press, Incorporated. ISBN 978-1-716-74552-2.

External links

• A tutorial on Fenwick Trees on TopCoder
• An article on Fenwick Trees on Algorithmist
• An entry on Fenwick Trees on Polymath wiki
• stack exchange