binomial - 22 Binomial Heaps Big Picture(Figure 19.1 Pg 456...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
22 Binomial Heaps Big Picture (Figure 19.1, Pg 456) New Operations: UNION( , ) creates and returns a new heap that contains all the nodes of heaps and (which are destroyed by this operation). DECREASE-KEY( ) assigns to a node in heap a new key value , which is its current value. DELETE( ) 22.1 Binomial Trees An ordered tree that is defined recursively (See Fig 19.2, Pg 458). 1. consists of a single node. 2. consists of two trees that are linked by making the root of one the leftmost child of the root of the other. 84
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Properties of 1. nodes. 2. height is 3. There are exactly nodes at depth for . 4. the root has degree . 5. Corollary: The maximum degree of any node in an -node binomial tree is . I’m skipping proofs because they are simple, but you should try them yourselves. Definition of a binomial heap A binomial heap is a set of binomial trees such that 1. each binomial tree has the min property. 2. for any integer
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/09/2010 for the course CS 12345 taught by Professor Thomas during the Spring '10 term at École Normale Supérieure.

Page1 / 5

binomial - 22 Binomial Heaps Big Picture(Figure 19.1 Pg 456...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online