1. Given an array of element 5, 7, 9, 1, 3, 10, 8, 4. Which of the following are the correct sequences of elements after inserting all the elements in a min-heap?
2. Left child of parent node has value lesser than the parent node.
3. What is the run time efficiency of an insertion algorithm in d-heap?
4. Which of the following is difficult to determine the right path length?
5. If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.
6. An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
7. How is a pairing heap represented?
8. What is the fundamental operation performed in skew heaps?
9. The leaf node for a heap of height h will be at which position.
10. What is the efficiency of merge used in leftist heaps?
Read More Section(Heaps)
Each Section contains maximum 100 MCQs question on Heaps. To get more questions visit other sections.