title: Best way to join two red-black trees
body: <p>The easiest way is to store two trees in two arrays, merge them and build a new red-black tree with a sorted array which takes O(m + n) times.</p>
  
  <p>Is there an algorithm with less time complexity?</p>