e/Weight-balanced tree

Information
has gloss	eng: A weight-balanced binary tree is a binary tree which is balanced based on knowledge of the probabilities of searching for each individual node. Within each subtree, the node with the highest weight appears at the root. This can result in more efficient searching performance.
lexicalization	eng: Weight-balanced tree
instance of	e/Binary tree

Media
media:img	Weight balanced tree2.jpg