tree depth
RU: глубина дерева
The length of the longest path from root to leaf in a tree. In a recursion tree, depth equals the maximum recursion level. A tree of depth d has at most b^d nodes (where b is branching factor).
RU: глубина дерева
The length of the longest path from root to leaf in a tree. In a recursion tree, depth equals the maximum recursion level. A tree of depth d has at most b^d nodes (where b is branching factor).