completewinnertree.output

来自「datastucutre and algorithms, application」· OUTPUT 代码 · 共 19 行

Enter number of players, >= 2
Enter player values
The winner tree is
number of players  = 10 lowExt = 4 offset = 15
complete winner tree pointers are
10 3 10 3 5 8 10 1 3 
Changed player 2 to zero, new tree is
number of players  = 10 lowExt = 4 offset = 15
complete winner tree pointers are
2 2 10 2 5 8 10 2 3 
Changed player 3 to -1, new tree is
number of players  = 10 lowExt = 4 offset = 15
complete winner tree pointers are
3 3 10 3 5 8 10 2 3 
Changed player 7 to 2, new tree is
number of players  = 10 lowExt = 4 offset = 15
complete winner tree pointers are
3 3 10 3 5 7 10 2 3