The Investment Lemma
It costs at most 3 floor(log(n)) + 1 new dollars (this is the money you pay me) to splay a tree with n nodes while maintaining the Money Invariant everywhere.
We’ll do the proof of this later.
Previous slide
Next slide
Back to first slide
View graphic version