Write a function:
void printTree(int vals[], int size);
which takes an array of size at least size as its first parameter.
Assume that size is at most 15.
This will print the elements of the array on up to 4 lines in tree form similar to printTree15 of Lab Assignment 2, but it will stop after size entries of the array. Do not output more lines than necessary.
Put the function in a file called printtree.c and write a main program to test this. The main program should start by printing your name. Use a makefile and use separate compilation. Be sure to also run lint.
Run the test program to produce sample output.
Test the program with the array of size 10 from the class discussion of
the heapsort.
Use cut and paste to send the output to
cs2213 as part of a mail message with subject line:
cs 2213 lab assignment 3 results
Be sure that you use cut and paste. Do not send your results as an attachment which assumes a particular type of mail reader. Use a mailer that does not wrap lines before position 80. Make sure you send this to cs2213 and not to srobbins.
Do not send this email before Friday, February 9, at noon.