In this exercise, you are not making a program. Instead, your pretend that you are a computer and perform the exercise in your head writing the results and steps on paper. There is in2.txt input file that contain numbers (heap elements) separated by whitespaces. element from left to right
Read the numbers from the file and create a heap. Insert an element by from the file to the heap. The minimum element must be in the root of the heap tree. an
On paper, draw the heap tree after the first element is inserted, then the heap tree after the second element is inserted, etc. Draw the heap tree on each step including the final heap tree.
You may draw multiple trees on one page but large enough to be recognizable. Scan the pages and submit them (you can use any common file format, for example PDF or PNG).
If you find the building heap from in2.txt file is difficult, try to build another heap from in3.txt - the resulting tree has to be as in in3_sample. txt file. There is no need to submit drawings for in3.txt. in2.txt Notepad -
File Edit Format 12 79 21 16 24 33 19 68 65 26 32 18 3 X in3.txt Notepad View Help File Edit Format 13 21 16 24 31 19 68 65 26 32 X