balanced tree
balanced tree
(algorithm)A B-tree is a kind of balanced tree that can have morethan two subtrees at each node (i.e. one that is notrestricted to being a binary tree).
单词 | balanced tree |
释义 | balanced treebalanced tree(algorithm)A B-tree is a kind of balanced tree that can have morethan two subtrees at each node (i.e. one that is notrestricted to being a binary tree). |
随便看 |
|
英语词典包含2567994条英英释义在线翻译词条,基本涵盖了全部常用单词的英英翻译及用法,是英语学习的有利工具。