Second Extra Credit Quiz
CS 225 Data Structures and Software Principles
Fall 2007
Friday, November 2
Name:
NetID:
Lab Section (Day/Time):
MC1 (1pt)
In an array-based implementation of a Heap, the left-child of the right-child of the node at index i, if
it exists, can be found at what array location?
1. 4i+ 3
2. 2i+ 1
3. 4i+ 1
4. 2i+ 2
5. 4i+ 2
MC2 (1pt)
Suppose you are asked to implement a heap class member function called find whose purpose is to
return the location of a particular key in the heap. Which of the following best reflects the worst case
running time of the function?
1. O(1)
2. O(log n)
3. O(n)
4. O(nlog n)
5. find cannot be implemented in a heap.
