Class Notes (838,403)
Canada (510,881)
CSC263H1 (54)
Lecture 3

Lecture 3.docx

2 Pages
71 Views
Unlock Document

Department
Computer Science
Course
CSC263H1
Professor
Toniann Pitassi
Semester
Winter

Description
ADT OPS Data Structures Priority Q Insert(S,x) (Max) Heap Max(S) CLRS (chapter 6) Extract_Max(S) Mergeable Priority Q Insert(S,x) Binomial Heaps Max(S) Extract_Max(S) Union(S, T) Binomial Heaps - Facts about Sk Trees: - ∀ k ≥ 0: Sk- trees has 2^k nodes k - There are (d nodes at depth d Def: A Binomial forest of size n (BF n is a sequence of Sk trees with strictly decreasing k's and a total of n nodes. Ex: a BF
More Less

Related notes for CSC263H1

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit