Register

Fibnocii heap

• recategorized by
660 views

1 Answer

Best answer
1 votes
1 votes

$trees(H)$ = number of trees in root list heap $H$

$marks(H)$ = number of marked nodes in heap $H$

                               $\phi (H) = trees(H) + 2*marks(H)$

$\phi (H)$ = Potential of H

tress(H) = 5

marks(H) = 3

$\phi (H) = 5 + 2*3$

               =  $11$

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
2
Thor-o-s asked Sep 1, 2022
415 views
Algorithm which uses Max heap to find i smallest elements
Can anyone please explain how to find “ i “ smallest elements from an array whose elements are distinct Please use max heap to explain the working input : n distinct elements output : i smallest elements
Can anyone please explain how to find “ i “ smallest elements from an array whose elements are distinctPlease use max heap to explain the working input : n distinct e...
User Avatar
0 votes
0 votes
1 answer
3
atulcse asked Jan 16, 2022
717 views
max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.
Consider the following graph:Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the ...
User Avatar
0 votes
0 votes
1 answer
4
saurav raghaw asked Dec 22, 2018
688 views
MIN HEAP
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not? (A) O(log n) (B) O(n) (C) O(n logn) (D) O(1)
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not?(A) O(log n)(B) O(n)(C) O(n logn)(D) O(1)
User Avatar
Link Copied!