 This implementation is based on bottom-up splaying version and uses the second method of deletion on a splay tree.Also, unlike the above definition, this C++ version does "not" splay the tree on finds - it only splays on insertions and deletions, and the find operation, therefore, has linear time complexity.templatekey; }

A simple amortized analysis of static splay trees can be carried out using the potential method.