Returning a tree as a string in InOrder sequence
<p>I must write a function which takes in an tree as an argument and returns it as a string in inorder sequence. </p>

<p>This is what I got. </p>

<pre><code>public static String concatInOrder( StringTreeNode t )
    {

        if(t == null) return "";

        return (t.left+t.val+t.right); 
    }
</code></pre>

<p>However I've ran into several difficulties with this. Several questions.</p>

<ol>
<li>Am I approaching the problem wrongly? </li>
<li>How may I improve my prowess when it comes to Binary Search tree manipulation WITHOUT the use of libraries and such? </li>
<li>What Am I missing? Isn't it true that inOrder sequence is left, current, right?  (val is short for value, so the leaf it's currently on.</li>
</ol>