This process is repeated until the final two collections of outcomes are merged into one, leading to a balanced binary tree with W log(W) such merge operations.
Ovaj proces se ponavlja sve dok poslednja dva rezultata spajanja ne budu spojena u jedan, što dovodi do balansiranog binarnog stabla sa W l o g ( W ) {\displaystyle Wlog(W)} takvih operacija spajanja.