51. What is the time taken to delete a minimum element in a leftist heap?
52. Why would a recursive implementation fail in skew heaps?
53. Which property should ternary heap hold for execution?
54. What is the basic operation performed in a pairing heap?
55. On which data structure is a d-ary heap based?
56. The actual pairing heap implementation uses the right child and left child representation.
57. What is the time complexity for creating a ternary heap using swapping?
58. What is a ternary heap?
59. Which of these operations have same complexities?
60. d-heap is shallower than a binary heap.
Read More Section(Heaps)
Each Section contains maximum 100 MCQs question on Heaps. To get more questions visit other sections.