Question

Data Structures and Algorithms (Java Programming)

Write an insert function for a heap class as well as all support functions that are called by your insert function.

Answer 1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

public class BinaryMinHeap {

     

      …

     

public void insert(int value) {

            if (heapSize == data.length)

                  throw new HeapException("Heap's underlying storage is overflow");

            else {

                  heapSize++;

                  data[heapSize - 1] = value;

                  siftUp(heapSize - 1);

            }

      }    

      …

     

private void siftUp(int nodeIndex) {

            int parentIndex, tmp;

            if (nodeIndex != 0) {

                  parentIndex = getParentIndex(nodeIndex);

                  if (data[parentIndex] > data[nodeIndex]) {

                        tmp = data[parentIndex];

                        data[parentIndex] = data[nodeIndex];

                        data[nodeIndex] = tmp;

                        siftUp(parentIndex);

                  }

            }

      }

}

Kindly revert for any queries

Thanks.