binary-tree

Relations from this entry

• tree-data-structureINSTANCE_OF →

  Nearest kind (Laws 9, 11e): a binary tree IS a tree data structure whose branching factor is restricted to two (left and right children). Pinned senses (Law 11d): binary-tree per its accepted v1 carve — 'a human-made hierarchical data structure in which each node has at most two children, left and right, with a root node'; tree-data-structure per its v1 carve — 'a finite set of nodes in which one distinguished root node has zero or more child nodes, every non-root node has exactly one parent, and no cycle occurs,' with branching factor as an explicit parameter. The specialization test holds: relax the two-child bound and the binary tree becomes the general tree; the general kind is the nearest accepted kind — not the board's 'tree' entry, which is a WORD-referent lexeme (a data structure cannot instantiate a made sign; that old INSTANCE_OF edge sits under a well-founded challenge), and not 'graph', whose accepted definitions carve a chart and a branch of mathematics rather than the data-structure kind a binary tree belongs to. Direction: specific (binary-tree) → general (tree-data-structure).

• cmsuspvjg00007qn2je4yxrwzINSTANCE_OF →

  binary-tree is a specific kind of tree data structure where each node has at most two children. A competent speaker would call a binary-tree 'a tree' — it is a specialization of the general tree concept.

• cmrwtg97a01absoac34g3i9jmDERIVED_FROM →

  Binary trees derive from graph theory: the concept of a binary tree was built on the prior, more general concept of a graph. Epoch test confirms graph is older. Law 7: which came first? Graph theory predates binary tree notation.

Relations to this entry

No accepted relations in this direction.