Binary lifting also solves the LCA problem: given two nodes and , find their lowest common ancestor. The idea: bring and to the same depth using binary lifting.
Then jump both upward simultaneously until they meet. This takes per query. You will implement this in the next problem. LCA is one of the most common tree queries in competitive programming, and binary lifting gives you a clean solution.