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

hasPathSum

Related Links:
Author: Marty Stepp (on 2020/11/05)

Write a method called hasPathSum that takes an integer n as a parameter and that returns true if there is some path from the overall root of a tree to a node of the tree in which the sum of the data stored in the nodes adds up to n (returning false if no such path exists). For example if the variable t refers to the following tree: 

                                 +----+
                                 |  5 |
                                 +----+
                               /        \
                             /            \
                      +----+                +----+
                      |  1 |                | 21 |
                      +----+                +----+
                     /      \                     \
                    /        \                     \
                +----+       +----+               +----+
                | -9 |       |  2 |               | 20 |
                +----+       +----+               +----+
               /      \                          /      \
              /        \                        /        \
          +----+      +----+                +----+      +----+
          |  3 |      | 30 |                | 13 |      |  4 |
          +----+      +----+                +----+      +----+

Below are various calls and an explanation for the value returned: 

        t.hasPathSum(8) returns true because of the path (5, 1, 2)
        t.hasPathSum(26) returns true because of the path (5, 21)
        t.hasPathSum(0) returns true because of the path (5, 1, -9, 3)
        t.hasPathSum(5) returns true because of the path (5)
        t.hasPathSum(1) returns false because no path with that sum exists
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.