adplus-dvertising
frame-decoration

Question

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

a.

True

b.

False

c.

May be

d.

Can't say

Answer: (b).False

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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?

Q. What is simple uniform hashing?

Q. In simple uniform hashing, what is the search complexity?

Q. In simple chaining, what data structure is appropriate?

Q. When is it appropriate to use direct addressing?

Q. What is the time complexity to insert an element into the direct address table?

Q. What is the advantage of using a dynamic set in direct addressing?

Q. What is the time complexity to delete an element from the direct address table?