Question: 2. (15 points) Heaps Give an O(1) algorithm for finding the third-smallest element in a balanced unique min- heap. Give your answer using pseudocode or

2. (15 points) Heaps Give an O(1) algorithm for finding the third-smallest element in a balanced unique min- heap. Give your answer using pseudocode or clear English with a diagram. Prove your running time bound
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
