首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > 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...

  • 资源大小:1.58 kB
  • 上传时间:2021-06-30
  • 下载次数:0次
  • 浏览次数:0次
  • 资源积分:1积分
  • 标      签: Windows开发

资 源 简 介

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.

文 件 列 表

JJ.CPP
VIP VIP
0.186898s