CS200AlgorithmsandDataStructures
Worksheet for Trees
1. Given the binary tree operations, what tree or trees does the following sequence of
statements produce?
Public void Ex11(){
BinaryTree<Integer> t1 = new BinaryTree<Integer>(2);
t1.attachLeft(5)
BinaryTree<Integer> t2 = new BinaryTree<Integer>(8);
t2.attachLeft(6);
t2.attachRight(7);
t1.attachRightSubtree(t2);
BinaryTree<Integer> t3 = new BinaryTree<Integer>(7);
t3.atachLeft(3);
t3.attachRight(1);
BinaryTree<Integer> t4 = new BinaryTree<Integer> (1, t1, t3);
}
2. 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 follow;
If the root is a min node, the value of the tree is equal to the
minimum of
a. The integer stored in the root
b. The value of the left subtree, but only if it is
nonempty
c. 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.
An example of the minmax tree (square node: max node, circle node: min node)
