These two seem very similar and have almost an identical structure. What's the difference? What are the runtime complexities of each?
What's the difference between a binary search tree and a binary heap?
data structures;binary trees;heaps
Heap just guarantees that elements on higher levels are greater (for max-heap) or smaller (for min-heap) than elements on lower levels, whereas BST guarantees order (from left to right). If you want sorted elements, go with BST.by Dante is not a geekHeap is better at findMin/findMax (O(1)), while BST is good at all finds (O(logN)). Insert is O(logN) for both structures. If you only care about findMin/findMax (e.g. priority-related), go with heap. If you want everything sorted, go with BST.by xysun