| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Balanced binary tree | Math | A binary tree where no leaf is more than a certain amount farther from the root than any other. After inserting or deleting a node, the tree may rebalanced with "rotations." (references) | |
| Binary tree | Computing | Binary tree (btree) A tree in which each node has at most two successors or child nodes. In Haskell this could be represented as data BTree a = NilTree | Node a (BTree a) (BTree a) See also balanced tree. (1994-11-29). Source: The Free On-line Dictionary of Computing.. | |
| Binary tree | Math | A tree with at most two children for each node. (references) | |
| Binary tree representation of trees | Math | A way to represent a multiway tree as a binary tree. The leftmost child, c, of a node, n, in the multiway tree is the left child, c', of the corresponding node, n', in the binary tree. The immediately right sibling of c is the right child of c'. (references) | |
| Complete binary tree | Math | A binary tree in which all leaf nodes are at some depth n or n-1, and all leaves at depth n are toward the left. (references) | |
| Extended binary tree | Math | A binary tree with special nodes replacing every null subtree. Every regular node has two children, and every special node has no children. (references) | |
| Perfect binary tree | Math | A binary tree with all leaf nodes at the same depth. All internal nodes have degree 2. (references) | |
| Threaded binary tree | Math | A theoretical measure of the execution of an algorithm, usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f (n)= (g (n)) means it is within a constant multiple of g (n). The equation is read, "f of n is theta g of n". (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
Topics by Level of Interest: BINARY TREE | ||||
| Topics sorted by level of Interest | Level (1=low, 600=high) | Topics sorted Alphabetically | Level (1=low, 600=high) | |
| Binary tree | 22 | Binary tree | 22 | |
| Threaded binary tree | 6 | Left child-right sibling binary tree | 3 | |
| Left child-right sibling binary tree | 3 | Threaded binary tree | 6 | |
Source: the editor, created by/for EVE to gauge likely levels of human interest in linguistically triggered topics (compiled across various sources, such as Wikipedia and specialty expression glosses). | ||||
