Search:

I figured it out.


static boolean method (BinaryTree t)
{
...
return method2(t, t.root());
}

I'm not sure how to write a recursive method with a tree as a parameter.
I'm guessing you have to call its subtree every time.

In my book, I'm given BinaryTree t and Node v as my parameter. So, I can traverse the tree by doing like:



static boolean add(BinaryTree t, Node v )
return add(t, t.left(v)) + add(t,...