<?xml version="1.0" encoding="UTF-8"?>

<record version="4" id="2706">
 <title>balanced tree</title>
 <name>BalancedTree</name>
 <created>2002-02-25 21:07:05</created>
 <modified>2007-09-01 08:20:35</modified>
 <type>Data Structure</type>
 <creator id="13753" name="Mathprof"/>
 <author id="13753" name="Mathprof"/>
 <author id="6" name="Logan"/>
 <classification>
	<category scheme="msc" code="05C05"/>
 </classification>
 <related>
	<object name="Tree"/>
	<object name="BalancedBinaryTree"/>
	<object name="Heap"/>
	<object name="BinaryTree"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}</preamble>
 <content>A \emph{balanced tree } is a rooted tree where no leaf is much farther 
away from the root than any other leaf. 
Different balancing \PMlinkescapetext{schemes} allow different definitions of "much farther" and 
different amounts of work to keep them balanced. For an example, see binary tree.


</content>
</record>
