Trees

Fenwick Tree

A compact binary indexed tree for prefix sums and updates.

Learn with an interactive visualization

Category: Trees. Complexity: Sum / update O(log n) · Prefix minimum O(n).

A compact binary indexed tree for prefix sums and updates. Interactive visualization, Java and C++ code, operations, complexity, and a complete…