##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Sample LCA trace)
Tree: has children . Node has children . Query: LCA. Both have , so no initial jump. Check up[4][1], up[5][1]: both are (same), so do not jump . Check up[4][0] = 2, up[5][0] = 2: same, so do not jump . Wait, they are already at the same parent. Return up[4][0] = 2.
LCA is . Since both nodes share the same parent, the algorithm finds it immediately.
