title: Priority Queue remove complexity time
body: <p>What is the complexity (big-oh) for the <code>remove()</code> function on the Priority Queue class in Java? I can't find anything documented anywhere, I think it's O(n), considering you have to find the element before you remove it and then reshuffle the tree. but I've seen others that disagree and think it's O(logn). Any ideas?</p>