术语 | complete binary tree |
释义 | complete binary tree 完全[备]二叉树 A binary tree with leaves on at most two adjacent levels. The leaves at the bottom-most level must lie in the leftmost positions of that level. 一种二叉树,其叶子最多只能在相邻的两层上出现;最底层上的叶子必须处于该层最左边的位置。 |
随便看 |
|
计算机英汉双解词典包含21137条计算机术语英汉翻译词条,基本涵盖了全部常用计算机术语的翻译及用法,是计算机学习及翻译工作的有利工具。