One names depth of a tree the maximum number of "descents" which can be carried...

代码说明：

One names depth of a tree the maximum number of "descents" which can be carried out starting from the root. For example, the third binary tree of figure 1 has a depth of 3.According to this reasoning, a tree having one or no node is of depth 0.