+1 vote
in Data Structures & Algorithms I by (88.2k points)
Choose the correct properties of weak-heap.

(a) Every node has value greater than the value of child node

(b) Every right child of node has greater value than parent node

(c) Every left child of node has greater value than parent node

(d) Every left and right child of node has same value as parent node

The question is from Weak Heap in division Heap of Data Structures & Algorithms I

I had been asked this question during an interview for a job.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (b) Every right child of node has greater value than parent node

The best explanation: This is the property of a weak heap.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...