No, Binary search trees gaurentee that the left node > the node > the right node, while heaps guarantee that the main node > either child, but in no particular order. Also, heaps mix in indexing, too...