Typo in fenwick.md

3centroids · web-flow · commit 11f808b0371e · 2024-01-24T20:02:09.000+01:00
diff --git a/src/data_structures/fenwick.md b/src/data_structures/fenwick.md
@@ -227,7 +227,7 @@ struct FenwickTreeMin {
 
 Note: it is possible to implement a Fenwick tree that can handle arbitrary minimum range queries and arbitrary updates.
 The paper [Efficient Range Minimum Queries using Binary Indexed Trees](http://ioinformatics.org/oi/pdf/v9_2015_39_44.pdf) describes such an approach.
-However with that approach you need to maintain a second binary indexed trees over the data, with a slightly different structure, since you one tree is not enough to store the values of all elements in the array.
+However with that approach you need to maintain a second binary indexed tree over the data, with a slightly different structure, since one tree is not enough to store the values of all elements in the array.
 The implementation is also a lot harder compared to the normal implementation for sums.
 
 ### Finding sum in two-dimensional array
