State 5 ways how binary heap average insertion 0(1) is different from Binary search tree average insertionO(log(n)). How are their algorithms different (minimum of 2 sentences for each point).