Difference between revisions of "CSC212 Final Exam 2014"
| Line 19: | Line 19: | ||
=Problem #2= | =Problem #2= | ||
<br /> | <br /> | ||
| − | * in a heap of ''N'' items, | + | * in a heap of ''N'' items, where the largest item is at the root, we can find the smallest item in the heap in O(log(N)). True or False? |
