Conceptcore
Randomly built binary search tree
A binary search tree built by inserting keys in random order, whose expected height is logarithmic in the number of keys.
A binary search tree built by inserting keys in random order, whose expected height is logarithmic in the number of keys.
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 WJ2D8W Edit this page History Report an error