Leetcode 1483. Kth Ancestor of a Tree Node

Given a rooted tree as a parent[] array, preprocess it to efficiently answer many queries asking for the k-th ancestor of a node (return -1 if it doesn't exist). The core challenge is supporting up to ~5·10^4 nodes/queries by using a log-depth jump-pointer (binary lifting) structure to achieve fast queries after preprocessing.