http://everydaylearnsalittlebit.blogspot.com/2015/10/httpwwwmitbbscomarticletjobhunting33072.html
1. find kth minimal number in tournament tree. sample of tournament tree (2
beat 4, 3 beat 5, 2 beat 3 and become champion)
2
2 3
4 2, 3, 5
http://www.geeksforgeeks.org/tournament-tree-and-binary-heap/
https://blogs.oracle.com/malkit/entry/finding_kth_minimum_partial_ordering
1. find kth minimal number in tournament tree. sample of tournament tree (2
beat 4, 3 beat 5, 2 beat 3 and become champion)
2
2 3
4 2, 3, 5
http://www.geeksforgeeks.org/tournament-tree-and-binary-heap/
Tournament tree is a form of min (max) heap which is a complete binary tree. Every external node represents a player and internal node represents winner. In a tournament tree every internal node contains winner and every leaf node contains one player.
There will be N – 1 internal nodes in a binary tree with N leaf (external) nodes.
The information explored during best player selection can be used to minimize the number of comparisons in tracing the next best players. For example, we can pick second best player in (N + log2N – 2) comparisons.
https://blogs.oracle.com/malkit/entry/finding_kth_minimum_partial_ordering
