This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Prove that not both these operations can be done in o (log n ) time even if amortization is allowed. 4. Consider the cut operation in Fibonacci heaps. In the usual implementation, a node is cut as soon as it loses two of its children. Lets change this rule: a node is cut as soon as it loses three of its children. Analyse this variant of Fibonacci heap. Is MaxDeg ( n ) still O (log n )? 5. In next class, well show that insertions in redblack trees cost 2 rotations (case 2) and upto O(log n) color changes (case 1). Show that amortized color updates per insertion is O(1). (Hint: to develop an appropriate potential function try to see what is decreasing in the structure when we push the redconict upwards in case 1.) 1...
View
Full
Document
This note was uploaded on 10/02/2011 for the course CS 7300 taught by Professor R during the Spring '11 term at LSU.
 Spring '11
 r
 Algorithms

Click to edit the document details