单词 | binary tree |
释义 | > as lemmasbinary tree binary tree n. Computing a tree in which each node has two or fewer subtrees or pointers, esp. a balanced tree of this kind; a configuration that can be represented in this way. Cf. B-tree n. ΘΚΠ society > computing and information technology > data > [noun] > structure > tree binary tree1960 B-tree1968 1960 Computer Jrnl. 3 84/2 Any other point [than the root] is connected to one and only one point in the next lower level and up to n points in the next higher level. For a binary tree, n = 2 and we shall discuss only binary trees in what follows. 1968 D. E. Knuth Art of Computer Programming I. ii. 315 General trees are usually represented in terms of some equivalent binary tree inside a computer. 1983 P. Linz Programming Concepts & Problem Solving x. 255 Arithmetic expressions can also be represented by binary trees. 1984 Sci. News 16 June 380/2 Underpinning NON VON's architecture is a structural configuration known as a ‘binary tree’. In it, a single, tiny processor is connected to two identical ones beneath it, each of which is in turn connected to two more below it, and so on. < as lemmas |
随便看 |
|
英语词典包含1132095条英英释义在线翻译词条,基本涵盖了全部常用单词的英英翻译及用法,是英语学习的有利工具。