 In addition to the proven performance guarantees for splay trees there is an unproven conjecture of great interest from the original Sleator and Tarjan paper.This conjecture is known as the "dynamic optimality conjecture" and it basically claims that splay trees perform as well as any other binary search tree algorithm up to a constant factor.There are several corollaries of the dynamic optimality conjecture that remain unproven