logo Practice-It logo

Main Page → Problems → Solve a Problem

sum

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

Write a method sum that returns the sum of the data values stored in the tree. For example, the following tree has a sum of 33: 

            +----+
            |  3 |
            +----+
           /      \
          /        \
      +----+      +----+
      | -9 |      | 15 |
      +----+      +----+
     /      \           \
    /        \           \
+----+      +----+      +----+
| 12 |      | 24 |      |  0 |
+----+      +----+      +----+
           /      \
          /        \
      +----+      +----+
      |  3 |      | -9 |
      +----+      +----+
     /                  \
    /                    \
+----+                  +----+
|  0 |                  | -6 |
+----+                  +----+

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.