Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Fenwick Tree (Binary Indexed Tree)
Bookmark
Input
Standard
Small
Larger
Multiples of 10
Custom
arr
=
[1, 3, 5, 7, 9, 2]
,
updateIndex
=
2
,
updateValue
=
10
,
queryIndex
=
4
Phase: Build
Original Array (0-indexed)
1
0
3
1
5
2
7
3
9
4
2
5
BIT Array (1-indexed)
0
1
0
2
0
3
0
4
0
5
0
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Build
Original Array (0-indexed)
1
0
3
1
5
2
7
3
9
4
2
5
BIT Array (1-indexed)
0
1
0
2
0
3
0
4
0
5
0
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Build
Original Array (0-indexed)
1
0
3
1
5
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
0
2
0
3
0
4
0
5
0
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Build
Original Array (0-indexed)
1
0
3
1
5
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
1
2
0
3
1
4
0
5
0
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Build
Original Array (0-indexed)
1
0
3
1
5
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
4
2
0
3
4
4
0
5
0
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Build
Original Array (0-indexed)
1
0
3
1
5
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
4
2
5
3
9
4
0
5
0
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Build
Original Array (0-indexed)
1
0
3
1
5
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
4
2
5
3
16
4
9
5
0
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Build
Original Array (0-indexed)
1
0
3
1
5
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
4
2
5
3
16
4
9
5
11
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Point Update
Original Array (0-indexed)
1
0
3
1
10
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
4
2
10
3
16
4
9
5
11
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Phase: Prefix Sum Query
Original Array (0-indexed)
1
0
3
1
10
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
4
2
10
3
21
4
9
5
11
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
Complete
Original Array (0-indexed)
1
0
3
1
10
2
7
3
9
4
2
5
BIT Array (1-indexed)
1
1
4
2
10
3
21
4
9
5
11
6
[1]
[1..2]
[3]
[1..4]
[5]
[5..6]
algo
master
.
io
Step:
Start: Demonstrate Fenwick Tree (Binary Indexed Tree) operations, build, point update, and prefix sum query.
0 / 27
Input
Standard
Small
Larger
Multiples of 10
Custom
arr
=
[1, 3, 5, 7, 9, 2]
,
updateIndex
=
2
,
updateValue
=
10
,
queryIndex
=
4
0 / 27
algo
master
.
io
Step:
Start: Demonstrate Fenwick Tree (Binary Indexed Tree) operations, build, point update, and prefix sum query.
