figure calculating node properties the run time efficiency for heap insertion is (log nthe run time is by product of verifying heap order as the first part of the algorithm (the actual insertion into the arrayis ( figure shows the steps of inserting the values and into min-heap