61. How many secondary operations are performed in a d-heap?
62. The number of trees in a binomial heap with n nodes is
63. The worst case analysis for a naive merge is given as?
64. What is the run time efficiency of delete-min operation?
65. What is the time complexity for increasing priority of key in a minimum ternary heap of n elements?
66. The total comparisons in finding both smallest and largest elements are
Read More Section(Heaps)
Each Section contains maximum 100 MCQs question on Heaps. To get more questions visit other sections.