(computer science) A tree, usually a binary tree, where the number of levels of child nodes extending from any given node does not differ by more than one. This is desirable for efficiency when searching in binary search trees. Approaches to ensure trees are balanced include red black trees. The opposite of a balanced tree is a stick, which is just a linked list with lots of wasted memory and is the result of inserting into a binary search tree from a sorted list.

Log in or register to write something here or to contact authors.