Overview

balanced


Show Summary Details

Quick Reference

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.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.