CSC 431/509 – Fall 2020: Homework 03 Due: 09/18/2020 Submission: Upload your scanned submission to Canvas. Instructions:Read each of the following problem(s) carefully. Write your solutions neatly on...

algorithms


CSC 431/509 – Fall 2020: Homework 03 Due: 09/18/2020 Submission: Upload your scanned submission to Canvas. Instructions:Read each of the following problem(s) carefully. Write your solutions neatly on a separate sheet of paper. No collaboration is permitted. The only reference materials allowed are the class notes, lecture videos, and the textbook. No collaboration is allowed, and any submission found identical or nearly identical will be considered as instances of cheating. Write your name at the top of every page you submit. I. Does the following array represent a max heap? If not, precisely explain the violation. If the array does represent a max heap, then draw the binary tree representation of the heap. 〈23, 17, 14, 6, 13, 10, 1, 5, 7, 8〉 II. Does the following array represent a max heap? If not, precisely explain the violation. If the array does represent a max heap, then draw the binary tree representation of the heap. 〈23, 17, 14, 6, 13, 10, 1, 5, 7, 12〉 Page 1 of 1