MIT6_851S10_assn09

MIT6_851S10_assn09 - 6.851 Advanced Data Structures...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6.851 Advanced Data Structures (Spring’10) Prof. Erik Demaine Dr. Andr´ e Schulz TA: Aleksandar Zlateski Problem 9 Due: Thursday, Apr. 15 Be sure to read the instructions on the assignments section of the class web page. Link-cut tree analysis. 1. For the bound of the number of preferred child changes we used the heavy-light edge de- composition of the forest. We showed that the preferred child changes during the access operations happen only O (log n ) time per operation (amortized). In the analysis we counted all light preferred edge creations ( O (log n ) per access). Then we argued that the total num- ber of heavy preferred edge creations is smaller than the total number of light preferred edge creations plus n . Check if the link/cut operations interfere with this counting scheme. In particular, we might create to many light preferred edges during a link or cut. Can we charge these costs to the link/cut operations?...
View Full Document

This note was uploaded on 03/31/2011 for the course EECS 6.851 taught by Professor Erikdemaine during the Spring '10 term at MIT.

Page1 / 2

MIT6_851S10_assn09 - 6.851 Advanced Data Structures...

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

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