The search starts from the root node of the tree.

In some trees, such as heaps, the root node has special properties.

The color of the root node will determine the nature of the game.

Create the root node and the layer of the target variable.

The root node represents the certain event and therefore has probability 1.

Finally, the root node will again contain the minimum element on the left hand side.

Finally, the root node will again contain the max element on the right hand side.

These features resemble those of trees, in that there is a single root node, and an order to the elements.

There is at most one root node in a rooted tree.

The s-value of the root node 4 is also now 2.