Min Heap Deletion Write pseudocode or C++ code describing a…
Min Heap Deletion Write pseudocode or C++ code describing a function that returns the smallest value in a binary Min Heap (min() operation). Include the function header (return type, method name, parameters) [2 points]. Describe how deletion works in a min heap [2 points]. Write pseudocode or C++ code describing a function that deletes a node from a binary Min Heap (extractMin). Include the function header (return type, method name, parameters) [5 points]. State the worst case time complexity for your min() and extraMin() function [1 point]. You can assume the following if needed: It is a 0-indexed integer Min Heap The Min Heap array and its size is passed into this function. The array is already large enough to store another node; i.e. it does not need to be resized.
Read DetailsThe test files are below. Feel free to print a hard copy if…
The test files are below. Feel free to print a hard copy if you like. If you need to leave the room for a minute or two to print or scan that is fine. Please upload Problem 1 “.dwg” file to Question 1 and the “.pdf” file to Question 2. Please upload Problem 2 “.dwg” file to Question 3 and the “.pdf” file to Question 4. Your test score will only be reflected in the first question. There are 4 files to upload total, .dwg & .pdf for each problem. You will upload the files using the upload link below, just like you would do if this were a homework assignment. TEST2_FALL_2024.pdf The test instructions. CuestaTitleBlock.dwg Copy this title block drawing to your Desktop then insert it into the layout TEST2_FALL_2024.dwt Download this template for Problem 2 Please upload the “.dwg” file below for question 1:
Read Details