The truth is that a Fenwick tree can be seen, in a certain sense, as a "half" of a segment tree. Specifically, assume n is a power of two, then a segment tree's segments will always divide evenly into powers of two down to the last level as illustrated below:
This is how various segments are split by such a tree:
Note that if a segment starts at zero, we will only use the blue segments, which are the left children in the segment tree:
Since computing sums on intervals [l, r) can be reduced to computing prefix sums (for intervals starting at zero), we can limit ourselves to keeping just the blue segments. Additionally, each blue segment can be uniquely associated with the position of its right-hand side, and the specific layout provided by n being a power of two allows for a direct computation of the segment beginning given its end. That's where the previous segment in the split starts, so we get an explicit way to enumerate constituent segments. Thus we get a Fenwick tree:
New questions arise:
For these, I refer you to this blog post.