| Webster's Online Dictionary |
| Expressions | Definition | ||
| Height-balanced tree | A height-balanced tree is a tree data structure which keeps its children similar in height to within some defined limit. For example, children of an AVL tree differ in height by at most 1. (references) | ||
Source: compiled by the editor from various references; see credits. | Top | ||
| Expressions | Domain | Definition | |
| Height-balanced tree | Math | A tree whose subtrees differ in height by no more than one and the subtrees are height-balanced, too. An empty tree is height-balanced. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||