Help with integer-based heap (Java, data structures)?
-
Hey, I got a little homework from my class, and I missed a few days and I am now behind. I cannot find a tutorial anywhere online that can help me. I was wondering if anyone could answer this for me and walk me through it? "We are building an integer-based heap by inserting the following integers in the heap: 5, 3, 2, 6, 7, 4, 1. Please draw the corresponding heap after each integer is inserted. After the above integers are inserted, we delete from the heap for 6 times. Please draw the heap after each deletion is performed on the heap." From my understanding, the numbers look like they go into a "tree" descending in order or something. Please help!
-
Answer:
First in, is last out.
paintbal... at Yahoo! Answers Visit the source
Related Q & A:
- Is Integer Factorization Harder Than RSA Factorization?Best solution by Theoretical Computer Science
- How would you transfer data between your data structures and databases?Best solution by Programmers
- How to Implement Gateway Service something similar to Oracle API gateway Using Java and Java based Open Source frameworks only?Best solution by Quora
- When do you need large heap for Elasticsearch?Best solution by Stack Overflow
- I need help with writing up the Java Code.Best solution by Yahoo! Answers
Just Added Q & A:
- How many active mobile subscribers are there in China?Best solution by Quora
- How to find the right vacation?Best solution by bookit.com
- How To Make Your Own Primer?Best solution by thekrazycouponlady.com
- How do you get the domain & range?Best solution by ChaCha
- How do you open pop up blockers?Best solution by Yahoo! Answers
For every problem there is a solution! Proved by Solucija.
-
Got an issue and looking for advice?
-
Ask Solucija to search every corner of the Web for help.
-
Get workable solutions and helpful tips in a moment.
Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.