balanced

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.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

JOHN DAINTITH. "balanced." A Dictionary of Computing. 2004. Encyclopedia.com. 1 Oct. 2016 <http://www.encyclopedia.com>.

JOHN DAINTITH. "balanced." A Dictionary of Computing. 2004. Encyclopedia.com. (October 1, 2016). http://www.encyclopedia.com/doc/1O11-balanced.html

JOHN DAINTITH. "balanced." A Dictionary of Computing. 2004. Retrieved October 01, 2016 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-balanced.html