CSC263H1 Lecture 4: Lecture 4.docx

44 views1 pages
School
Course

Document Summary

B. heap bf7 = <111>2 = 4 + 2 + 1 = 7. 6, 1, 8, 5, 9, 7, 10 into a heap will be. |t| n => at most o(log n) trees. |q| n => at most o(log n) trees. Min(s): scan the roots of the trees of s to find the minimum key takes o(log n) computations. Total cos of k successive inserts into a bh t with |t| = t. Insert (t, x1), insert(t, x2), , insert(t, xk) Every comparison that you do creates an edge. |t| = 27 = 16 + 8 + 2 + 1 = <11011>

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions