logo Practice-It logo


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

Write a method printLevel that accepts an integer parameter n and that prints the values at level n from the left to right, one per line. We will use the convention that the overallRoot is at level 1, that its children are at level 2, and so on. For example, if a variable tree stores a reference to the following tree:

            | 12 |
           /      \
          /        \
      +----+      +----+
      | 19 |      | 93 |
      +----+      +----+
     /      \           \
    /        \           \
+----+      +----+      +----+
| 11 |      | 14 |      | 15 |
+----+      +----+      +----+
      | 10 |

Then the call tree.printLevel(3); would produce the following output:


If there are no values at the level, your method should produce no output. Your method should throw an IllegalArgumentException if passed a value for a level n that is less than 1.

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.