##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Finding 13th ancestor)
Say and you are at node . Binary: . Bit is set: jump steps. Now v = up[v][3], . Bit is set: jump steps.
Now v = up[v][2], . Bit is set: jump step. Now v = up[v][0], . You have jumped steps in three jumps. Each jump uses one precomputed entry from the table, so no extra traversal is needed.
