I'm studying algorithm analysis by "Introduction to alogrithm".
What I'm learning is proof by recursion tree but I can't understand how can I calculate height of recursion tree.
So I searched stackoverflow and found the answer but there was no details.
How to determine the height of a recursion tree from a recurrence relation?
Can you explain why $\log_b n$ can be depth(height)?