title: Why do we need binary heaps when we have binary search trees?
body: <p>I have been reading about trees and found dictionary operations like search, find, and delete take log(n) time in a balanced binary search tree.</p>
  <p>Similar is the time complexities in the case of Heaps. So, why do we need them when we have a sorted structure(BSTs) that provides identical time complexities for other operations?</p>
  <p>Why can't we just use a Balanced BST to build priority queues?</p>