Data Structure Questions and Answers-Weak Heap
Choose the correct properties of weak-heap.
Every node has value greater than the value of child node
Every right child of node has greater value than parent node
Every left child of node has greater value than parent node
None of the mentioned
Question 1 Explanation:
This is the property of a weak -heap.
Left child of parent node has value lesser than the parent node.
Question 2 Explanation:
Weak heap has no left child.
What is the other name of weak heap?
Question 3 Explanation:
Relaxed heap is just another name of weak heap.
What is the worst case time in searching minimum value in weak -heap?
Question 4 Explanation:
Weak heap is an array based form that supports the operation of finding minimum in O(1).
The total comparisons in finding both smallest and largest elements are
n + ((n+1)/2) -2
Question 5 Explanation:
There are 5 questions to complete.