Starting with the MaxHeap class provided in zyBooks, add an overloaded + operator to the MaxHeap class that combines two MaxHeaps into a single MaxHeap.
You'll also need to add a copy constructor and overloaded assignment operator.
Part of your challenge here should be to create the most efficient algorithm for this that you can. The straightforward algorithm is to iterate through one of the heaps, using Insert() to add each one to the other heap. This is a O(nlogn) algorithm. You'll get full credit for this solution. However, it's possible to create a O(n) algorithm. As an extra challenge (no points!), you might want to give this a try.
No documentation is required.