Euler tour with entry-exit times uses positions for entry times. Each node occupies one entry position. Segment tree on this array uses space (the tree has nodes but that is still ).
BIT uses space directly. Total memory: for the tree structure, for flattened array, for segment tree or BIT. All linear. For , you need around to megabytes total, well within typical memory limits.