##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Sample input trace)
Say , tree: (a chain). Query: (find rd boss of employee ). Build : up[5][0] = 4, up[5][1] = 3, up[5][2] = 1. Now jump: (bits , set). Jump : v = up[5][1] = 3. Jump : v = up[3][0] = 2. Answer: .
You reached the answer in jumps instead of single steps. For large trees, the savings are dramatic.
