Important Notice:

Practice-It will be discontinued as of November 1st, 2024. After this date, the website will remain online for a transitional period, but login will be restricted to University of Washington NetID authentication. This marks the next phase towards the platform's full retirement. Thank you for your use and support of the application over the years.

If you are looking for an alternative, a similar tool, CodeStepByStep, was developed independently by the original author of Practice-It, and is available at codestepbystep.com**

logo Practice-It logo

Main Page → Problems → Solve a Problem

BJP5 Exercise 17.19: evenLevels

Related Links:
Author: Allison Obourn (on 2019/09/19)

Write a method evenLevels that could be added to the IntTree class from lecture and section. The method should make sure that all branches end on an even level. If a leaf node is on an odd level it should be removed from the tree. We will define the root as being on level 1.

The following table shows the results of a call of your method on a particular tree:

before after 
                  +----+
                  | 67 |
                  +----+
               /          \
            /                \
       +----+                +----+
       | 80 |                | 52 |
       +----+                +----+
      /      \              /      \
     /        \            /        \
 +----+     +----+      +----+    +----+
 | 16 |     | 21 |      | 99 |    | 12 |
 +----+     +----+      +----+    +----+
             /  \           \
            /    \           \
        +----+  +----+      +----+
        | 45 |  | 33 |      | 67 |
        +----+  +----+      +----+
                    \
                     \
                     +----+
                     | 22 |
                     +----+

                  +----+
                  | 67 |
                  +----+
               /          \
            /                \
       +----+                +----+
       | 80 |                | 52 |
       +----+                +----+
             \               /      
              \             /        
            +----+      +----+    
            | 21 |      | 99 |    
            +----+      +----+    
             /  \           \
            /    \           \
        +----+  +----+      +----+
        | 45 |  | 33 |      | 67 |
        +----+  +----+      +----+

You may define private helper methods to solve this problem, but otherwise you may not call any other methods of the tree class nor create any data structures such as arrays, lists, etc. You should not construct any new node objects or change the data of any nodes. For full credit, your solution must be recursive and properly utilize the x = change(x) pattern.

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.