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 this question:
file= open('book.txt') #open file
li= {} #define an empty list
for lines in file: # use for loop Split file data into words
d= lines.lower().strip(' !?').split() #define variable d that Add it to map
for val in d: #define loop to store data
if val not in li: #check value is not in list
li[val] = 0 #define list and assign value in 0
li[val] = li[val] + 1 #Sort the book data and add its value
m = sorted(li.items(),key = lambda x : -x[1]) #sorted value into the m variable
print(m[:10]) #print value
Output:
please find the attachment.
Explanation:
In the given python code first, we open the file "book.txt", in next line, an empty list is defined, that uses the for loop which can be described as follows:
- In the for loop is used, that reads the file data, and defines a variable "d", that stores the values into the map.
- In the next line another loop is used, that check file values, if values are the same type so, it adds values and writes it.
- In the last line, m variable is used, that sorts the values and use the slicing to print its value.
