术语 | complete tree |
释义 | complete tree 完全树 Any tree constructed from a full tree of depth k by deleting some of the leaf nodes and the arcs leading to them. In a complete binary tree, the deleted nodes are often constrained to be the rightmost terminal nodes. The term is also sometimes used as a synonym for full tree. 通过删去深度为k的完整树的某些叶节点及其有关弧而构成的任何一种树。在完全二叉树中, 被删节点通常必须是最右边的终端节点。有时也把complete tree当作full的同义词。 |
随便看 |
|
计算机英汉双解词典包含21137条计算机术语英汉翻译词条,基本涵盖了全部常用计算机术语的翻译及用法,是计算机学习及翻译工作的有利工具。