StackRating
An Elo-based rating system for Stack Overflow
Home
|
About
|
Stats and Analysis
|
Get a Badge
Answers and rating deltas for
Prove that a binary tree with n leaves has a height of at least log n
Author
Votes
Δ
pkpnd
3
+3.39
Sekuraz
1
-3.39
Last visited: Aug 13, 2018, 10:34:56 AM