Question
Let a be a Fibonacci-heap with n elements that results from a sequence
of insert, combine, delete min, delete and decrease key operations
performed on initially empty F-heaps. Let b be any node in any of the
min-trees of a. What is the maximum degree of b?(m=no. of elements in
the sub tree with root b, φ=(1+√5)/2 ).
Let a be a Fibonacci-heap with n elements that results from a sequence
of insert, combine, delete min, delete and decrease key operations
performed on initially empty F-heaps. Let b be any node in any of the
min-trees of a. What is the maximum degree of b?(m=no. of elements in
the sub tree with root b, φ=(1+√5)/2 ).
Answer: Option B
Submit Your Solution Below and Earn Points !
Submit Your Solution Below and Earn Points !
More Questions on This Topic :
Question 7.
Structure of threaded binary tree :
....
Question 10.
Number of distinct binary trees with 7 nodes:
....
Latest Videos
Latest Test Papers
Submit Solution