Q101
Open questionGiven 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?
Select an option to see the answer and solution.
Data Structure · all questionsHeaps
Heaps
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
166
Questions
6/9
Page
Pick an option on a question to see the right answer and solution.
Q102
Open questionLeft child of parent node has value lesser than the parent node.
Select an option to see the answer and solution.
Q103
Open questionWhat is the run time efficiency of an insertion algorithm in d-heap?
Select an option to see the answer and solution.
Q104
Open questionWhich of the following is difficult to determine the right path length?
Select an option to see the answer and solution.
Q105
Open questionIf 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.
Select an option to see the answer and solution.
Q106
Open questionAn 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
Select an option to see the answer and solution.
Q107
Open questionHow is a pairing heap represented?
Select an option to see the answer and solution.
Q108
Open questionWhat is the fundamental operation performed in skew heaps?
Select an option to see the answer and solution.
Q109
Open questionThe leaf node for a heap of height h will be at which position.
Select an option to see the answer and solution.
Q110
Open questionWhat is the efficiency of merge used in leftist heaps?
Select an option to see the answer and solution.
Q111
Open questionDoes there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.
Select an option to see the answer and solution.
Q112
Open question. . . . . . . . is a self-adjusting version of a leftist heap.
Select an option to see the answer and solution.
Q113
Open questionWhat is the location of a parent node for any arbitary node i?
Select an option to see the answer and solution.
Q114
Open questionWhat is the height of a given minimum ternary heap?
Select an option to see the answer and solution.
Q115
Open questionIn a leftist heap, the null path length of a null node is defined as?
Select an option to see the answer and solution.
Q116
Open questionThe roots of the elements of the subtrees are smaller than the root of the heap.
Select an option to see the answer and solution.
Q117
Open questionIn a binomial heap the root value is greater than left child and less than right child.
Select an option to see the answer and solution.
Q118
Open questionThe worst case complexity of deleting any arbitrary node value element from heap is . . . . . . . .
Select an option to see the answer and solution.
Q119
Open questionThe worst case running time of all operations in a skew heap is given as?
Select an option to see the answer and solution.
Q120
Open questionIn what time can a leftist heap be built?
Select an option to see the answer and solution.