PYTHON LANGUAGE

CS 2302 Data Structures Fall 2018 Project 5-Option B Overview Complete the implementation of the Min-Heap data structure (you'll find a partial implementation in the Appendix that you need to complete). After doing this, use your implementation of the data structure to implement heapsort. Test your implementation by doing at least one of the following options Unit Tests Reading a file with a list of numbers separated by commas and printing the sorted sequence Creating a separate file where you call your heapsort implementation using hard-coded lists of numbers . . Appendix class Heap def init (self): self.heap_array D definsert(self, k: se lf.heap array.append(k) # TODO: Complete implementation defextract min(self): if selfis empty0: return None min_elem self.heap_array.append[0] # TODO: Complete implementation return min elem defis empty(s elf): return len(self.heap array)0 CS 2302 Data Structures Fall 2018 Project 5-Option B Overview Complete the implementation of the Min-Heap data structure (you'll find a partial implementation in the Appendix that you need to complete). After doing this, use your implementation of the data structure to implement heapsort. Test your implementation by doing at least one of the following options Unit Tests Reading a file with a list of numbers separated by commas and printing the sorted sequence Creating a separate file where you call your heapsort implementation using hard-coded lists of numbers . . Appendix class Heap def init (self): self.heap_array D definsert(self, k: se lf.heap array.append(k) # TODO: Complete implementation defextract min(self): if selfis empty0: return None min_elem self.heap_array.append[0] # TODO: Complete implementation return min elem defis empty(s elf): return len(self.heap array)0