|
关注：1
2013-05-23 12:21
求翻译：树（tree）是包含n（n>0）个结点的有穷集合，其中： （1）每个元素称为结点（node）； （2）有一个特定的结点被称为根结点或树根（root）。是什么意思？ 待解决
 悬赏分：1
- 离问题结束还有
树（tree）是包含n（n>0）个结点的有穷集合，其中： （1）每个元素称为结点（node）； （2）有一个特定的结点被称为根结点或树根（root）。
问题补充： |
|
2013-05-23 12:21:38
Tree (tree) contains n (n> 0) a finite set of nodes, which: (1) each element is called a junction point (node); (2) a specific node called the root node points, or roots (root).
|
|
2013-05-23 12:23:18
Tree (tree) is n (n > 0) there is a junction of poor collection, some of which are: (1) each of the elements known as nexus (node), and (2) there is a particular point is known as the root node or root of the tree (root).
|
|
2013-05-23 12:24:58
Sets up (tree) is contains n(n>0) point the finite set to gather, among: (1) each element is called point (node); (2) has a specific point to be called the root node or tree root (root).
|
|
2013-05-23 12:26:38
Tree (tree) that contains n (n>0), a nodal point finite collection, including: (1) each element is called node (node); (2) have a specific node is called the root node or the root (root).
|
|
2013-05-23 12:28:18
正在翻译，请等待...
|
湖北省互联网违法和不良信息举报平台 | 网上有害信息举报专区 | 电信诈骗举报专区 | 涉历史虚无主义有害信息举报专区 | 涉企侵权举报专区
