Here's the setup for the analysis.
- A credit buys: two rotations (and the find).
- Credit rule: on node x,
credits,
where W(x) is the number of nodes in the subtree rooted at x. - Charge for each operation:
credits
for a splay on a tree with n nodes.
Still need to show that we have sufficient credits to pay for an
operation, and, after an operation, we still have sufficient credits
to satisfy our credit rule.
Next: Maintain Credit Rule: Zig-Zig
Up: ANALYSIS OF SPLAY TREES
Previous: Splay Operations