查看会员资料
用 户 名：koukou*******
发送消息- Email：用户隐藏
- Icq/MSN：
- 电话号码：
- Homepage：
- 会员简介：
最新会员发布资源
JJ
- 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.