StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
The expected height of a randomly filled binary search tree on n distinct keys is O(log(n))
| Author | Votes | Δ |
|---|---|---|
| Lavish Kothari | 2 | 0.00 |
Last visited: Jun 17, 2019, 2:59:36 PM