// Play a complete round of the game, starting at the root of the tree
// and working down to a leaf node. If the program correctly guessed
// the name, it wins. If it didn't get the name correct, it learns
// the name the player had in mind and grows the tree to include the
// new name, the old name, and a new phrase that delineates them.
public static void PlayOneRound(BinTree tree)
{
// tree.HardCode();
PlayR(tree, tree.Root);
}
// Play a complete round of the game, starting at the root of the tree
// and working down to a leaf node. If the program correctly guessed
// the name, it wins. If it didn't get the name correct, it learns
// the name the player had in mind and grows the tree to include the
// new name, the old name, and a new phrase that delineates them.
public static void PlayOneRound(BinTree tree)
{
}
