Why do we prefer the complicated algorithm given below, rather than the much simpler algorithm given in the question above.

Problem 5.27 Consider the algorithm for inserting a new item into a binomial heap H given in Section 5.8. A simpler method would be to create a binomial tree Bo as in step (i) of the algorithm, make it into a binomial heap, and merge this new heap with H. Why did we prefer the more complicated algorithm