Question 31 : What is the reason for the efficiency of a pairing heap?
1. simplicity
2. time-efficient
3. space-efficient
4. advanced
View Answer   Discuss with Members

Question 32 : What is the efficiency of merge used in leftist heaps?
1. O(N)
2. O(N log N)
3. O(M log N)
4. O(log N)
View Answer   Discuss with Members

Question 33 : What is order of resultant heap after merging two tree of order k?
1. 2*k
2. k+1
3. k*k
4. k+logk
View Answer   Discuss with Members

Question 34 : In a leftist heap, the null path length of a null node is defined as?
1. 0
2. 1
3. null
4. -1
View Answer   Discuss with Members

Question 35 : Is decrease priority operation performed more quickly in a ternary heap with respect to the binary heap.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 36 : Heap can be used as ________________
1. Priority queue
2. Stack
3. A decreasing order array
4. None of the mentioned
View Answer   Discuss with Members

Question 37 : Out of the following given options, which is the fastest algorithm?
1. fibonacci heap
2. pairing heap
3. d-ary heap
4. binary heap
View Answer   Discuss with Members

Question 38 : What is the fundamental operation performed in skew heaps?
1. intersection
2. difference
3. merging
4. sorting
View Answer   Discuss with Members

Question 39 : How is a pairing heap represented?
1. binary tree
2. fibonacci tree
3. heap ordered tree
4. treap
View Answer   Discuss with Members

Question 40 : Choose the option with function having same complexity for a fibonacci heap.
1. Insertion, Union
2. Insertion, Deletion
3. extract_min, insertion
4. Union, delete
View Answer   Discuss with Members