Removing the Min Element from Deaps

Now we shall explain the technique for removing the min elements in the deap data structure. During deletion, our main target to delete the minimal value from deaps. As the height of the tree is always log n, it consumes time of order of log n. We can discuss deletion operation as follows −

Procedure deap_deletion(b[],m):
if(mb[k+1])
      k++;
   }
   k=max_value(i);
   if(x>b[k]){
      b[i]=b[k];
      insert y into maximum subtree;
   } else {
      insert y into minimum subtree;
}