Q141
Open questionWhat is the time complexity for increasing priority of key in a maximum ternary heap of n elements?
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
8/9
Page
Pick an option on a question to see the right answer and solution.
Q142
Open questionHow many properties does a leftist heap support?
Select an option to see the answer and solution.
Q143
Open questionMin heap is a complete binary tree.
Select an option to see the answer and solution.
Q144
Open questionThe Statement "Fibonacci heap has better amortized running time in compare to a binomial heap".
Select an option to see the answer and solution.
Q145
Open questionWhich of the following methods is the best choice for complex applications?
Select an option to see the answer and solution.
Q146
Open questionIs the priority queue abstract data type.
Select an option to see the answer and solution.
Q147
Open questionWhat is the amortized cost per operation of a skew heap?
Select an option to see the answer and solution.
Q148
Open questionWhat is the best case complexity in building a heap?
Select an option to see the answer and solution.
Q149
Open questionThe following figure is an example for
Select an option to see the answer and solution.
Q150
Open questionWhat is the time complexity for decreasing priority of key in a maximum ternary heap of n elements?
Select an option to see the answer and solution.
Q151
Open questionWhat is the time taken to delete a minimum element in a leftist heap?
Select an option to see the answer and solution.
Q152
Open questionWhy would a recursive implementation fail in skew heaps?
Select an option to see the answer and solution.
Q153
Open questionWhich property should ternary heap hold for execution?
Select an option to see the answer and solution.
Q154
Open questionWhat is the basic operation performed in a pairing heap?
Select an option to see the answer and solution.
Q155
Open questionOn which data structure is a d-ary heap based?
Select an option to see the answer and solution.
Q156
Open questionThe actual pairing heap implementation uses the right child and left child representation.
Select an option to see the answer and solution.
Q157
Open questionWhat is the time complexity for creating a ternary heap using swapping?
Select an option to see the answer and solution.
Q158
Open questionWhat is a ternary heap?
Select an option to see the answer and solution.
Q159
Open questionWhich of these operations have same complexities?
Select an option to see the answer and solution.
Q160
Open questiond-heap is shallower than a binary heap.
Select an option to see the answer and solution.