Printing sorted numbers from k different trees without knowing which is which
<p>Given <code>k</code> binary search trees <code>T_1 ,..., T_k</code>, with total of <code>n</code> different numbers.</p>

<p>For each <code>1 &lt;= i &lt;= k-2</code> : <code>T_i &lt; T_{i+2}</code> (all <code>T_i</code> numbers are less than <code>T_{i+2}</code> numbers). </p>

<p>How to print the <code>n</code> numbers sorted? </p>

<p>Time: <code>O(n + k*log(k))</code></p>

<p>You don't know the indices of the trees, meaning that <code>Sort(k Trees)</code> does not necessarily gets the first tree as <code>T_1</code> and so on...</p>