- Related Questions & Answers
- Splay trees in Data Structure
- Splay in Virtual Tree in Data Structure
- Solid Trees in Data Structure
- Range Trees in Data Structure
- BSP Trees in Data Structure
- Huffman Trees in Data Structure
- R-trees in Data Structure
- Interval Trees in Data Structure
- Segment Trees in Data Structure
- Comparison of Search Trees in Data Structure
- Tournament Trees, Winner Trees and Loser Trees in Data Structure
- Optimal Lopsided Trees in Data Structure
- Threaded Binary Trees in Data Structure
- Red-Black Trees in Data Structure
- Dynamic Finger Search Trees in Data Structure

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

In addition to the proven performance guarantees for splay trees there is an unproven conjecture with great interest. Dynamic optimality conjecture denotes this conjecture. Let any binary search tree algorithm such as B accesses an element y by traversing the path from the root to y at a cost of d(y)+1, and that between accesses can make any rotations in the tree at a cost of 1 per rotation. Let B(s) be the cost for B to perform the sequence s of accesses. Then the cost for a splay tree to perform the same accesses is O[n+B(s)].

There are so many corollaries of the dynamic optimality conjecture that remain unproven

**Traversal Conjecture**et same elements are contained by two splay trees t1 and t2. The sequence obtained by visiting the elements in t2 in preorder (i.e., depth first search order) be assumed as s. Entire cost of performing the sequence s of accesses on t1 is O(n).

**Deque Conjecture**et a sequence s of p double-ended queue operations (push, pop, inject, eject) is defined. Then the cost of performing s sequence on a splay tree is O(p+n).

**Split Conjecture**et s be any permutation of the elements of the splay tree. Then the cost for the deletion the elements in the order s is O(n).

Advertisements