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

height

Language/Type: Java binary trees implementing IntTree
Related Links:
Author: Stuart Reges (on 2020/11/05)

Write a method height that returns the height of a binary tree. The height of a tree is defined to be the number of levels it has (i.e., the number of nodes along the longest path from the root to a leaf). The empty tree has a height of 0. A tree of one node has a height of 1. A root node with one or two leaves as children has a height of 2. And so on.

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.