Theoremcore
Expected depth of random binary search trees
Also called random BST height bound.
A BST built from random insertion orders has expected height O(log n) and expected node depth O(log n).
A BST built from random insertion orders has expected height O(log n) and expected node depth O(log n).
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 ZDXZ6S Edit this page History Report an error