Given two B trees, T1 and T2, so that every element is T2 is bigger than every element in T1, joined into a B tree

问题

Given two B trees of same t, T1 and T2, so that every element is T2 is bigger than every element in T1. I have to join them into a single B tree in the most efficient way.

Any ideas?

来源：https://stackoverflow.com/questions/61563583/given-two-b-trees-t1-and-t2-so-that-every-element-is-t2-is-bigger-than-every-e