CIS 321 Assignment 5
- Binary heap that we studied in class is one of the heap structures. Please read about “Binomial Heap” and “Fibonacci Heap” and answer the following questions –
- Please briefly define “Binomial Heap” and “Fibonacci Heap”, assuming min-heaps for all.
- What are the major difference among “Binary Heap”, “Binomial Heap”, and “Fibonacci Heap” in terms of “insert” and “delete (min)” operations?
- What is the merge operation? What are the running times of the merge operation for “Binomial Heap” and “Fibonacci Heap” using the big O notation?
- Paste your document as the email message or send your document as an email attachment to zwang@shepherd.edu by 11pm on 3/30. Please write CIS 321 and your full name on the subject line of your email.