Consider a nonempty binary tree with two types of nodes: min nodes and max nodes. Each nod...

Consider a nonempty binary tree with two types of nodes: min nodes and max nodes. Each node has an integer value initially associated with it. You can define the value of such a minimax tree as follows:

■ If the root is a min node, the value of the tree is equal to the minimum of

□ The integer stored in the root

□ The value of the left subtree, but only if it is nonempty

□ The value of the right subtree, but only if it is nonempty

■ If the root is a max node, the value of the tree is equal to the maximum of the above three values.

shows a completed minimax tree.

a. Compute the value of the minimax tree in Figure. Each node is labeled with its initial value.

b. Write a general solution in Java for representing and evaluating these trees.

A minimax tree for Exercise 20