title: UNION OF 2-3 TREES?
body: <p>I have two 2-3 tree T1 (with n1 keys) and T2 (with n2 keys)</p>
  <p>Knowing each key in T1 is less than every key in T2 how can I return a 2-3 tree which holds the union of the keys in <code>O(max{log(n1),log(n2)})</code>?</p>
  <p>I'm looking for the idea/algorithm rather than the code which I could write in my own.</p>