Same company tree as before. Now, given two employees and , find their lowest common boss (LCA). The LCA is the deepest node that is an ancestor of both and . This is the first shared boss in their chains to the CEO.
You will use binary lifting to solve this in per query. First equalize depths, then binary search upward for the divergence point. The table you already built for -th ancestor works here too.