adplus-dvertising
frame-decoration

Question

What is the other name of weak heap?

a.

Min-heap

b.

Max-heap

c.

Relaxed -heap

d.

Leonardo heap

Answer: (c).Relaxed -heap

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the other name of weak heap?

Similar Questions

Discover Related MCQs

Q. What is the worst case time in searching minimum value in weak -heap?

Q. The total comparisons in finding both smallest and largest elements are

Q. Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.

Q. The leaf node for a heap of height h will be at which position.

Q. The main distinguishable characterstic of a binomial heap from a binary heap is that

Q. The number of trees in a binomial heap with n nodes is

Q. In a binomial heap the root value is greater than left child and less than right child.

Q. What is order of resultant heap after merging two tree of order k?

Q. Time taken in decreasing the node value in a binomial heap is

Q. Which of these operations have same complexities?

Q. The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.

Q. Given a heap of n nodes.The maximum number of tree for building the heap is.

Q. Choose the option with function having same complexity for a fibonacci heap.

Q. What is a hash table?

Q. If several elements are competing for the same bucket in the hash table, what is it called?

Q. What is direct addressing?

Q. What is the search complexity in direct addressing?

Q. What is a hash function?

Q. What can be the techniques to avoid collision?

Q. What is the load factor?