Differences of a Heap with a Binary Search Tree

1. The shape of a heap is very regular
   • Binary search trees can have arbitrary shapes
2. In a heap, the left and right subtrees both store elements that are larger than the root element
   • In a binary search tree, smaller elements are stored in the left subtree and larger elements are stored in the right subtree