Required information

Ch $11$ Sec $1$ Ex $21$ MAIN $($DEPENDENT MULTI$-$PART PROBLEM $-$ ASSIGN ALL PARTS$)-$ Binary Tree for Chess Tournament

NOTE: This is a multi$-$part question. Once an answer is submitted, you will be unable to return to this part.

Suppose $1000$ people enter a chess tournament. The champion is determined in such a way that a player is eliminated after one loss and games are played until only one entrant has not lost. $($Assume there are no ties.$)$

Ch $11$ Sec $1$ Ex $21($a$)-$ Binary Tree for Chess Tournament

The given tournament can be modeled as a full binary tree with the winner of the entire tournament as the root. Which of the following is true for the binary tree?

$($You must provide an answer before moving to the next part.$)$

Multiple Choice

Each internal vertex represents the winner of the game played by its parents, and there are $1000$ leaves, one for each contestant.