logo Practice-It logo

Main Page → Problems → Solve a Problem

writeTree

Language/Type: Java binary trees implementing IntTree
Related Links:
Author: Robert Baxter

Write a method writeTree that prints the tree in a specific format. You are to perform a pre-order traversal of the tree, producing exactly one line of output for each node. Each output line should begin with a code indicating the type of node (from the table below) followed by the data in the node.

Below the table is a binary tree referenced by a variable tree and the output that a call of tree.writeTree(); would produce.

Code NodeType
0 leaf node (no children)
1 branch node with left child only
2 branch node with right child only
3 branch node with left and right children
Tree Output 
          +---+
          | 7 |
          +---+
         /     \
     +---+     +---+
     | 9 |     | 8 |
     +---+     +---+
    /         /     \
+---+     +---+     +---+
| 5 |     | 4 |     | 6 |
+---+     +---+     +---+
               \
               +---+
               | 9 |
               +---+

3 7
1 9
0 5
3 8
2 4
0 9
0 6

Assume that you are adding this method to the IntTree class as defined below: 

    public class IntTree {
        private IntTreeNode overallRoot;
        ...
    }
Type your solution here:


This is a partial class problem. Submit code that will become part of an existing Java class as described. You do not need to write the complete class, just the portion described in the problem.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.