3)In Fibonacci heaps, Prof. Bright suggests two rules: 1)allow k-children to be

Question

3)In Fibonacci heaps, Prof. Bright suggests two rules: 1)allow k-children to be deleted at a node before
requiring that a CASCADING-CUT occurs and 2)for every rank , instead of just 1 tree, allow k, k > 1,
trees (When there are k + 1 trees of a given rank, all existing trees of that rank are to be merged by
choosing the root of one tree as the root and other trees as additional k children of the root.)
Assume k is a constant, set up a recurrence and estimate its solution to determine the minimum number
of nodes in a ?bonacci heap of rank r.

Explanation / Answer

are you having exam of CS535?

Related Questions

Navigate

• Browse (All)
• Browse 3
• Subjects

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