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

BJP4 Self-Check 17.3: binaryTreeProperties

Language/Type: Java binary trees
Author: Marty Stepp (on 2016/09/08)

The following questions refer to the following tree: 

          +---+
          | 3 |
          +---+
         /     \
     +---+     +---+
     | 5 |     | 2 |
     +---+     +---+
    /         /     \
+---+     +---+     +---+
| 1 |     | 4 |     | 6 |
+---+     +---+     +---+
How many levels does it have?
How many branches (non-leaves) does it have?
Which node values are stored in the branches? (Write them separated by commas, in ascending order by value.)
How many leaves does it have?
Which node values are stored in the leaves? (Write them separated by commas, in ascending order by value.)
What value is stored at the root of the tree?
Which node(s) are the sibling(s) of the node storing the value 2? (If there is more than one, write them separated by commas, in ascending order by value.)
Which node(s) are the children of the node storing the value 2? (Write them separated by commas, in ascending order by value.)

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.