StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
How to prove that finding a successor n-1 times in the BST from the minimum node is O(n)?
| Author | Votes | Δ |
|---|---|---|
| templatetypedef | 2 | +0.22 |
| rliu | 1 | -1.78 |
Last visited: Sep 14, 2014, 5:07:29 AM