Inorder Traversal of Splay Trees
by
Colm Unlaing Mathematics
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Mathematics_inordertraversal,
author = {Colm Unlaing Mathematics},
title = {Inorder Traversal of Splay Trees},
year = {}
}
author = {Colm Unlaing Mathematics},
title = {Inorder Traversal of Splay Trees},
year = {}
}
Bookmarks
OpenURL
Abstract:
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the trees reasonably well balanced through a `splay heuristic.' Sleator and Tarjan showed that if amortised rather than worst-case times are considered, splay trees are optimal. Splay trees have the advantage of simplicity: they are much easier to implement than 2-3 trees, AVL trees, or red-black trees.
Citations
| 324 | The encyclopedia of integer sequences – Sloane, Plouffe - 1995 |
| 296 | Self-adjusting binary search trees – Sleator, Tarjan - 1985 |
| 9 | Data Structures and Network Algorithms CBMS 44. Society for Industrial and applied mathematics – Tarjan - 1983 |
