Q121
Open questionWhich operation cannot be directly performed in a d-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
7/9
Page
Pick an option on a question to see the right answer and solution.
Q122
Open questionWhich of the following is the application of minimum ternary heap?
Select an option to see the answer and solution.
Q123
Open questionThe amortized time efficiency for performing deletion of a minimum element is?
Select an option to see the answer and solution.
Q124
Open questionHow many comparisons will occur while performing a delete-min operation?
Select an option to see the answer and solution.
Q125
Open questionChoose the option with function having same complexity for a fibonacci heap.
Select an option to see the answer and solution.
Q126
Open questionWhich type of data structure is a ternary heap?
Select an option to see the answer and solution.
Q127
Open questionNaive merge cannot be done in a skew merge.
Select an option to see the answer and solution.
Q128
Open questionWhich of the heaps is implemented by the following figure?
Select an option to see the answer and solution.
Q129
Open questionWhat happens if the null path length is not updated?
Select an option to see the answer and solution.
Q130
Open questionWhat is the ancestor of the leaf node in a given minimum ternary heap?
Select an option to see the answer and solution.
Q131
Open questionGiven a heap of n nodes.The maximum number of tree for building the heap is.
Select an option to see the answer and solution.
Q132
Open questionHow many types of the merge are available in skew heaps?
Select an option to see the answer and solution.
Q133
Open questionThe ascending heap property is . . . . . . . .
Select an option to see the answer and solution.
Q134
Open questionThe procedure FindMin() to find the minimum element and the procedure DeleteMin() to delete the minimum element in min heap take . . . . . . . .
Select an option to see the answer and solution.
Q135
Open questionWhat is the amortized efficiency of skew merge?
Select an option to see the answer and solution.
Q136
Open questionWhich node contains a pointer to its parent?
Select an option to see the answer and solution.
Q137
Open questionWhat is the other name of weak heap?
Select an option to see the answer and solution.
Q138
Open questionWhat is the time per operation of merging, insertion and deletion operations in a skew heap?
Select an option to see the answer and solution.
Q139
Open questionWhat is the highest element of the given maximum ternary heap?
Select an option to see the answer and solution.
Q140
Open questionWhat is the node path length of a node with 0 or 1 child?
Select an option to see the answer and solution.