BQ2 is a Min Binomial Queue containing two Binomial Trees (B_1, B_) BQ1 is a Min

Question

BQ2 is a Min Binomial Queue containing two Binomial Trees (B_1, B_) BQ1 is a Min Binomial Queue containing three Binomial Trees {B_1, B_2, B_3) Merge these two Binomial Queues and then perform an Extract-Min operation on the merged queue. The following questions are about the resulting final Binomial Queue with 19 data elements. How many Binomial Trees will the resulting final BQ have? 1 2 3 4 none of these True or False? The resulting final BQ will have a B_0 tree with a node of priority 2 at its root

Explanation / Answer

Answer 31:

The simple strategy to be followed while merging binary queue is :

B0 will be added to B0, B1 will be added with B1 and so on

Now here there are two B1 two B2 and one B3

So Two B1 will give one B2

Now four B2 and one B3

Now four B2 will result in two B4 and will further be converted into one B8 so there will be total of two Binary heaps

So the correct option is B

Answer 32:

False, the complete merge detail is already described in answer number 31

Related Questions

Navigate

• Browse (All)
• Browse B
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.