views updated

balanced (height-balanced; depth-balanced) Denoting a tree that has height (and thus depth) approximately equal to the logarithm of the number of nodes in the tree. This property is usually achieved in a binary tree by ensuring every node is balanced according to some measure. See also AVL tree, B-tree.