Tournament Tree (Winner Tree) and Binary Heap Given a team of N players. How many minimum games are required to find second best player? We can use adversary arguments based on tournament tree (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.
Read full article from Tournament Tree (Winner Tree) and Binary Heap | GeeksforGeeks
