Time complexity of building binary indexed tree

what is time complexity of building binary indexed tree?

it takes logn time for updates and logn time for query , so if you have n elements and you need to update them in bit , it will take nlogn time