StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
How can an AVL tree have a complexity of O(log n) when the in-order traversal calls itself recursive
| Author | Votes | Δ |
|---|---|---|
| Eloy Pérez Torres | 3 | +3.94 |
| Frank Yellin | 1 | -3.94 |
Last visited: Nov 27, 2022, 9:27:33 PM