How to determine the height of a recursion tree from a recurrence relation?

Question

How does one go about determining the height of a recursion tree, built when dealing with recurrence run-times? How does it differ from determining the height of a regular tree

Answer 1

The depth of any tree is the smallest number of edges from the node to the tree root node.The depth of root node is 0.

Consider the recursion T(n)=aT(n/b) It results in the following recursion tree

It is clear that depth of tree is $\log_b n$ Depth is same as height of a tree.