Core Idea - Tree Structure

The input gives you $n-1$ integers: the boss of employee $2$, the boss of employee $3$, and so on. Employee $1$ is the CEO (root).

Build the tree by setting parent[i] to the given boss. Then build the $up$ table as described. Each query asks for up[v][?] where $?$ is $k$ decomposed into powers of $2$. No need to build an adjacency list for this problem. The parent array is all you need to fill the binary lifting table.