# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Data Structure Questions and Answers-Weak Heap

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

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.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Left child of parent node has value lesser than the parent node.

True | |

False |

Question 2 Explanation:

Weak heap has no left child.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the other name of weak heap?

Min-heap | |

Max-heap | |

Relaxed -heap | |

Leonardo heap |

Question 3 Explanation:

Relaxed heap is just another name of weak heap.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

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

O(log n) | |

O(n) | |

O(n logn) | |

O(1) |

Question 4 Explanation:

Weak heap is an array based form that supports the operation of finding minimum in O(1).

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

The total comparisons in finding both smallest and largest elements are

2*n +2 | |

n + ((n+1)/2) -2 | |

n+logn | |

n ^{2} |

Question 5 Explanation:

None.

There are 5 questions to complete.