Tree Problem/Test 2 Boost
This problem is due in class, Friday April 12, or you can submit
solutions electronically using
submit100 treeboost solution.cc
Points earned for this problem can be used to increase the
score of the second test. It is not possible to earn more than
the maximal number of points (which is 67 for test 2).
The declaration below is used for implementing binary trees
<![CDATA[
template <class Kind>
struct TNode // "standard binary tree declaration"
{
Kind info;
TNode * left;
TNode * right;
TNode (const Kind & val, TNode * lchild = 0, TNode * rchild = 0)
: info(val),
left(lchild),
right(rchild)
{}
};
]]>
Problem 1 (3 points)
Write a templated function CountEqual that returns
the number of nodes with info field equal to key.
For the tree diagrammed below on the left the call
CountEqual(tree,3) should evaluate to 2 and
the call CountEqual(tree,6) should evaluate to 1;
for the tree on the right the call CountEqual(tree,6) should
evaluate to 2.
<![CDATA[
template <class Kind>
int CountEqual(TNode<Kind> * tree, const Kind & key)
{
}
]]>
Problem 2 (6 points)
Write a funtion Mutate that will add nodes to a tree. For all
parent-child node pairs with the same info field value, a new node
should be added between the parent node and child node with a value one
less than the info field value of the parent/child node. The tree on
the left above will be changed into the tree on the right as a result
of the call Mutate(tree).
<![CDATA[
void Mutate(TNode<int> * tree)
]]>