<p>I now understand 13. 13 would be B, because removing an element in an ArrayList is O(n) while it is O(log n) in a Priority Queue assuming it is implemented as a min-heap.</p>
<p>12 still does not make any sense to me.</p>
<p>I now understand 13. 13 would be B, because removing an element in an ArrayList is O(n) while it is O(log n) in a Priority Queue assuming it is implemented as a min-heap.</p>
<p>12 still does not make any sense to me.</p>