Consider the following sequence of items 10, 36, 25, 54, 37, 12, 75, 68, 42, 86, 72, 90. Insert these items in the order above,
into an initially empty implicit binary max-heap. Show the heap throughout the process but write down the heap as an answer after every 3 INSERT() operations. (Just hand-simulate the behavior of the implicit binary max-heap, and draw the resulting heap, both throughout the entire process and the ones after every 3 INSERT() operations as answers (note that the former is to show all your work so that partial credits can be given in case you make mistakes, while the latter (answers) are the ones to be graded). Draw them in the form of a tree rather than an array.)
1 answer:
You might be interested in
Answer:
Following are the code to the given question:
#include <iostream>//header file
using namespace std;
int main()//main method
{
int r=26,x,y;//defining integer variable
char c;//defining a character variable
for(x= 1; y<= r; x++)//using for loop for count value
{
for(y= 1; y<= x; y++)//using for loop to convert value in triangle
{
c=(char)(y+64);//convert value into character
cout << c;//print character value
}
cout << "\n";//use print method for line break
}
return 0;
}
Output:
Please find the attachment file.
Explanation:
In this code, three integer variable "x,y, and r", and one character variable "c" is declared, that is used in the nested for loop, in the first for loop it counts the character value and in the next for loop, it converts the value into a triangle and uses the char variable to print its character value.
