Every node of a game tree must always be:

either a decision node or a terminal node

a terminal node

a decision node

an initial node

A game is called a game of perfect information if:

every information set includes exactly one decision node

if all components of the game are perfectly defined

if it is finite

the number of decision nodes is greater than the number of players