Implement binary heap using JAVA
A binary heap is a complete binary tree which satisfies the heap ordering property. The ordering can be one of two types: the min-heap property: the value of each node is greater than or equal to the value of its parent, with the minimum-value element at the root.
Steps to compile and run code: 1st Input is to enter size of heap. 2nd input is to select what operation to be done on the Heap List of operations: 1.Offer 2.Poll 3.Peek 4.Remove 5.Add