Maximum track binary tree
<p>-- java --
for the tree </p>

<blockquote>
<pre><code>     5
  4     3
30  5     
</code></pre>
</blockquote>

<p>I need to find the "Maximum track"
so for this tree, its 39 (5+4+30)</p>

<p>i need a function that do that (Complexity O(n))
can someone help me?</p>

<pre><code>public static int GetTreePath(BinTreeNode&lt;Integer&gt; t){
        if (t==null)
            return 0;

        if (t.IsLeve()){
            return t.getInfo();
        }else{
            GetTreePath(t.getLeft());
            GetTreePath(t.getRight());
        }
        return t.getInfo();
    }
</code></pre>
