Why isn't the time complexity of constructing a Fenwick tree tighter than $O(n\lg n)$?
Technically it is $O(n\log n)$, since big-O is an upper bound only, but your tighter bound of $O(n)$ is also correct.  (Without loss of generality, it suffices to restrict $n$ to powers of two; then the proof is easy.)