I am writting a code that should do the following for a d-heap:
1. deleteMin( and percolate down)
I have code that was given to us and is similar to this code:http://www.java-tips.org/java-se-tips/java.lang/priority-queue-binary-heap-implementation-in-3.html
I know how to do a d-heap by hand and how it works, but when it comes to putting it in code I over think the problem and I get stuck. What is the relationship between the parent and child nodes and how would this change the code to take an inputed value of d from the user? Thanks for the help.