Quick complexity check: what is the time complexity of preprocessing the Euler tour?
Answer: for the DFS traversal. What is the space complexity?
Answer: for the and arrays, plus whatever data structure you layer on top. What about query time?
That depends on your data structure. Segment tree gives per query. Fenwick tree also gives . The Euler tour itself adds no extra cost beyond the initial preprocessing.