Multiple Choice
In an array-based implementation of a heap,the parent of the node in items[i] is always stored in ______.
A) items[i/2]
B) items[(i-1) /2]
C) items[i-2]
D) items[(i-2) /2]
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q50: What is a linear implementation?
Q51: Which of the following is true about
Q52: A binary search tree implementation of a
Q53: If the item with a given search
Q54: The _ operation of the ADT table
Q55: The sorted reference-based implementation of the tableDelete
Q56: A priority queue orders its items by
Q57: A heap in which the root contains
Q58: What kind of implementation of the ADT
Q59: What is the effect of the assumption