I tried this question but there is some error occur while solving this algorithm.

See more:

C++

Consider a new B-tree operation COMBINE (T1,T2,k). This operation takes as input two B-trees T1 and T2 with the same minimum degree parameter t, plus a new key k that does not appear in either T1 or T2. We assume that all the keys in T1 are strictly smaller than k and all the keys in T2 are strictly larger than k. The COMBINE operation produces a new B-tree T , with the same minimum degree t, whose keys are those in T1, those in T2, plus k. In the process, it destroys the original trees T1 and T2. In this problem, you will design an algorithm to implement the COMBINE operation. Your algorithm should run in time O(|h1 − h2| + 1), where h1 and h2 are the heights of trees T1 and T2 respectively. In analyzing the costs, you should regard t as a constant. First consider the special case of the problem in which h1 is assumed to be equal to h2. Give an algorithm to combine the trees that runs in constant time.

What I have tried:

array a[0..n−1];
key k begin l ← 0;
r ← n−1
while l ≤ r
do m ← n
(l+r)/2
if
a[m]<k
then
l←m+1
else if
a[m]>k
then
r←m−1
else return
m
end if
end while
return
not found