| Display title | Splay tree |
| Default sort key | Splay Tree |
| Page length (in bytes) | 32,460 |
| Namespace ID | 0 |
| Page ID | 223914 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Jworkorg (talk | contribs) |
| Date of page creation | 17:57, 6 February 2024 |
| Latest editor | Jworkorg (talk | contribs) |
| Date of latest edit | 17:57, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Template:Infobox data structure-amortized
A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary search trees, a splay tree performs basic operations such as insertion, look-up and removal in O(log n) amortized... |
