Conceptintro
Balanced binary search tree
Also called balanced BST, height-balanced search tree.
A BST whose shape is kept near-minimal height so that search, insert and delete take O(log n) time in the worst case.
A BST whose shape is kept near-minimal height so that search, insert and delete take O(log n) time in the worst case.
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 NK90JR Edit this page History Report an error