Insertion into a Max Heap in Data Structure

Here we will see how to insert and elements from binary max heap data structures. Suppose the initial tree is like below −

Insertion Algorithm

insert(heap, n, item) −
Begin
   if heap is full, then exit
   else
      n := n + 1
      for i := n, i > 1, set i := i / 2 in each iteration, do
         if item <= heap[i/2], then break
         heap[i] = heap[i/2]
      done
   end if
   heap[i] := item
End

Example

Suppose we want to insert 30 into the heap −

Arnab Chakraborty

Published on 10-Aug-2020 09:12:59

• Related Questions & Answers
• Insertion Into a Max HBLT in Data Structure
• Deletion from a Max Heap in Data Structure
• Binary Heap in Data Structure
• B-tree Insertion in Data Structure
• B+ tree Insertion in Data Structure
• Max WBLT Operations in Data Structure
• Max Heap in Java
• Deletion of Max Element from a Max HBLT In Data Structure
• Convert min Heap to max Heap in C++
• Melding Two Max HBLTs in Data Structure
• Is Max Heap in Python?
• Insertion in the Red Black Tree in Data Structure
• Minimum element in a max heap in C++.
• Deletion of Arbitrary Element from a Max HBLT in Data Structure
• C++ Program to Implement Max Heap