Data structureadvanced
Splay tree
Also called self-adjusting BST.
Self-adjusting BST that splays every accessed key to the root; amortized O(log n) per operation.
Self-adjusting BST that splays every accessed key to the root; amortized O(log n) per operation.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag MX6QFK Edit this page History Report an error