Leetcode 1645. Hopper Company Queries II

Given a rooted company hierarchy and many queries about employee relationships (for example k-th ancestor or ancestor checks), preprocess the tree so you can answer each query quickly. The challenge is to build efficient jump/ancestor structures (e.g., binary lifting / sparse table) to handle large N and many queries within tight time limits.