| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Balanced binary search tree | Math | A binary search tree in which at most one node has one child. All other nodes have two or zero children. (references) | |
| Binary search tree | Math | A binary tree where every node's left subtree has values less than the node's value, and every right subtree has values greater. A new node is added as a leaf. (references) | |
| Height-balanced binary search tree | Math | A height-balanced tree which is also a binary search tree. It supports membership, insert, and delete operations in time logarithmic in the number of nodes in the tree. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
Topics by Level of Interest: BINARY SEARCH TREE | ||||
| Topics sorted by level of Interest | Level (1=low, 600=high) | Topics sorted Alphabetically | Level (1=low, 600=high) | |
| Binary search tree | 55 | Binary search tree | 55 | |
| Self-balancing binary search tree | 7 | Randomized binary search tree | 7 | |
| Randomized binary search tree | 7 | Self-balancing binary search tree | 7 | |
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). | ||||
