I have been trying to find one, yet I could not. I am not sure of how the push / pop methods would work. I want to implement a ThirdPriorityQueue on Binary Heap and I would like to see some pseudocode for the methods of the interface. Also, I would love to generalize the problem and solve this for K-th order. I have downloaded Udemy, but there was no such thing as a Third or K th Priority Queue there.
Also, maybe, a site that I can use to visualize what is happening. I find this site: https://www.cs.usfca.edu/~galles/visualization/Algorithms.html very helpful. However, I do not know the reason behind this, but it won't let me add negative numbers to my heap.