Quiz: Query Complexity

HLD path query: You query the path from $u$ to $v$ using a segment tree on each chain. What's the time complexity?

1. A.$O(\log^2 n)$
2. B.$O(n \log n)$
3. C.$O(\log n)$
4. D.$O(n)$