This preview shows page 1. Sign up to view the full content.
Unformatted text preview: worst-case O(n)
Good: average (amortized) case O(log n)
Often perform better than other BSTs in
R. Tarjan CSE 2011
Prof. J. Elder - 43 - Last Updated: 3/3/10 6:14 PM Splaying
Splaying is an operation performed on a node that
iteratively moves the node to the root of the tree.
In splay trees, each BST operation (find, insert, remove)
is augmented with a splay operation.
In this way, recently searched and inserted elements are
near the top of the tree, for quick access. CSE 2011
View Full Document
- Fall '11
- Data Structures