## BJP3 Exercise 17.10: doublePositives

Language/Type: Java binary trees recursion
Author: Robert Baxter (on 2013/04/01)

Write a method `doublePositives` that doubles all data values greater than 0 in a binary tree of integers. For example, the before and after of a call to `doublePositives` on a sample tree are shown below:

Before Call After Call
```            +----+
| -9 |
+----+
/      \
/        \
+----+      +----+
|  3 |      | 15 |
+----+      +----+
/           /      \
/           /        \
+----+      +----+      +----+
|  0 |      | 12 |      | 24 |
+----+      +----+      +----+
/      \
/        \
+----+      +----+
|  6 |      | -3 |
+----+      +----+
```
```            +----+
| -9 |
+----+
/      \
/        \
+----+      +----+
|  6 |      | 30 |
+----+      +----+
/           /      \
/           /        \
+----+      +----+      +----+
|  0 |      | 24 |      | 48 |
+----+      +----+      +----+
/      \
/        \
+----+      +----+
| 12 |      | -3 |
+----+      +----+
```

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.

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.