Topic: | Tree Grafting 1 |
Source Code: | graft1.cpp |
Live Archive Ref#: | 3821 |
Pre-lab Due: |
Thursday, Nov. 29, 10:00am |
Submission Deadline: | Sunday, Dec. 2, 11:59pm |
Techniques: |
Recursion, Tree traversals |
The pre-lab requirement must be completed and submitted individually.
The remainder of the lab activity should be completed working in pairs. One person should submit the result, making sure that both partners' names are clearly identified in that submission.
Please make sure you adhere to the policies on academic integrity in this regard.
Read the complete problem description and then determine what the expected output should be if given the following input:
Prelab input: | Prelab output: |
dddududuuu dduudduduu duddduduuu # |
Trees have many applications in computer science. Perhaps the most commonly used trees are rooted binary trees, but there are other types of rooted trees that may be useful as well. One example is ordered trees, in which the subtrees for any given node are ordered. The number of children of each node is variable, and there is no limit on the number. Formally, an ordered tree consists of a finite set of nodes T such that
Here is an example of such a tree, with three subtrees of the root.
0 / | \ 1 2 3 / \ 4 5
You are asked to write a program that computes the height of the tree.
The input is given by a number of lines giving the directions taken in a depth-first traversal of the trees. There is one line for each tree. For example, the tree above would give dudduduudu, meaning 0 down to 1, 1 up to 0, 0 down to 2, etc. The input is terminated by a line whose first character is #. You may assume that each tree has at least 2 and no more than 10000 nodes.
For each tree, print the heights of the tree. Use the format:
where t is the case number (starting from 1), and h is the height of the tree.Tree t: h
Example input: | Example output: |
dudduduudu ddddduuuuu dddduduuuu dddduuduuu # |
Tree 1: 2 Tree 2: 5 Tree 3: 4 Tree 4: 4 |
Although this problem can be trivially solved by keeping count of the depth as you parse the input, this lab is really a warmup for next week's lab (which was the real contest problem). For that reason, we would like for you to intentionally approach this lab with the following recursive approach. In the end we want a function that can compute the depth of the entire tree; we will design a recursion that computes the depth of any subtree. Consider the following local view:
If you were told the depths for each of the four children, can you compute the depth of the larger subtree?
Here is how we recommend setting up the recursion. Remember that the original input is just a sequence of 'd' and 'u' designators to describe the shape of the tree. We want to think about starting the recursion at the root. Technically, there is no 'd'/'u' pair in the input for going down to the root up up from it, but for consistency sake, we recommend that you alter the original input string by adding a preceding 'd' and a trailing 'u'. Then use a string iterator to implicitly traverse the tree as you do your computation. Use the following signature.
int depth(string::iterator& i);Assume that the function is called at a time when the iterator is pointing to the initial 'd' that moves down to a node. This call is supposed to compute the depth of the subtree at that node, and while doing so it should advance the iterator so that it is one spot past the final 'u' that designates moving back up from the given node (note that we pass the iterator as a non-const reference so that the caller will continue scanning after the characters that we've processed).