Multiple Choice
Which of the following statements about a heap is NOT correct?
A) A heap is a form of binary tree.
B) The shape of a heap is very regular.
C) A heap is always completely filled at all levels.
D) In a heap, both the right and left subtrees of any node store elements that are at least as large as the node value.
Correct Answer:
Verified
Correct Answer:
Verified
Q6: What is the efficiency of the heapsort
Q7: Consider the following binary search tree: <img
Q8: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7392/.jpg"
Q9: A binary tree of height h can
Q10: What is the efficiency of removing an
Q12: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7392/.jpg"
Q13: Removing an element from a balanced binary
Q14: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7392/.jpg"
Q15: The height of a tree can be
Q16: Adding an element to a balanced binary