11. Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.
12. . . . . . . . . is a self-adjusting version of a leftist heap.
13. What is the location of a parent node for any arbitary node i?
14. What is the height of a given minimum ternary heap?
15. In a leftist heap, the null path length of a null node is defined as?
16. The roots of the elements of the subtrees are smaller than the root of the heap.
17. In a binomial heap the root value is greater than left child and less than right child.
18. The worst case complexity of deleting any arbitrary node value element from heap is . . . . . . . .
19. The worst case running time of all operations in a skew heap is given as?
20. In what time can a leftist heap be built?
Read More Section(Heaps)
Each Section contains maximum 100 MCQs question on Heaps. To get more questions visit other sections.