Binary Tree Help - Find the largest sub-tree

[joshhazel]

I have a binary tree and want to traverse through it to find the sub tree that has the largest total value.

I get the concept of this issue but cannot quite figure out how i will program it. Any help appreciated.

[JosAH]

If you can build a method that calculates the 'size' of a tree, you can always add one parameter that can contain a Node and the size of the tree starting at that Node. The recursion is just needed for the calculation of the 'size'; the parameter is just passed around and contains the Node and its 'size'. the parameter has the type:

class Parameter {
   Node node;
   int size;
}

kind regards,

Jos

[joshhazel]

I need to be able to do this recursively without storing a sub-tree value.