Data structureresearch
WAVL tree
Also called weak AVL tree, rank-balanced tree.
A rank-based balanced tree that relaxes AVL rules, giving worst-case O(1) rotations per update and height bounds close to AVL.
A rank-based balanced tree that relaxes AVL rules, giving worst-case O(1) rotations per update and height bounds close to AVL.
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 9VPK2S Edit this page History Report an error