Insertions into a max heap with atmost one swap

Insertions into a max heap with atmost one swap

Is there a algorithm to perform insertions into a heap with atmost one
swap (O(log n) comparisons are allowed)