Search Trees_Part_9

Sleator bad worst case on good average amortized case

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: worst-case O(n) Good: average (amortized) case O(log n) Often perform better than other BSTs in practice 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 Prof. J....
View Full Document

Ask a homework question - tutors are online