After class a student asked why you would ever use a heap instead of a binary search tree. Provide a good explanation for why and when you would.

Heap is useful when you want to find max/min element in the given list

BinarySearchTree is used if you need sorted elements of the list

Explanation:

Heap is Good at finding Min/Max and it's time complexity is (O (1)), while BST is good at all finds (O (logN)). Insert is O (logN) for Heap and BSTstructures ...

Max Heap ensures that elements on higher levels are greater than elements at lower level

MinHeap ensures that elements on higher levels are lesser than elements at lower level

BST gives sorted elements by following order (left, root, right). If we want sorted elements we can go with BST