Create a class called BinaryHeap The BinaryHeap class will implement the followi

Question

Create a class called BinaryHeap

The BinaryHeap class will implement the following methods given K implements comparable and the Heap is backed by a resizing array that represents a min heap

void insert(K key) - Add this element to the heap

K deleteMin() - Remove the min element from the heap and return it

bool remove(K key) - remove an element from the heap and return true if successful or false if not.

Key[] heapSort() - Return an array that is a sorted representation of the data in the Heap (destructive)

void union(BinaryHeap b) - Create a union of the parameter heap with the underlying heap

*Use Java to implment code/program*Create a class called BinaryHeap

The BinaryHeap class will implement the following methods given K implements comparable and the Heap is backed by a resizing array that represents a min heap

void insert(K key) - Add this element to the heap

K deleteMin() - Remove the min element from the heap and return it

bool remove(K key) - remove an element from the heap and return true if successful or false if not.

Key[] heapSort() - Return an array that is a sorted representation of the data in the Heap (destructive)

void union(BinaryHeap b) - Create a union of the parameter heap with the underlying heap

*Use Java to implment code/program*

Explanation / Answer

Hi. please find the answer above.. i have given comments so that it is very easy for you to understand the flow. In case of any doubts, please ask in comments. If the answer helps you, please upvote. Thanks!

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.