<map id="DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;" name="DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;">
<area shape="rect" id="node2" href="$dd/d07/class_data_structures_1_1_a_v_l_balanced_binary_search_tree.xhtml" title="An AVLBalancedBinarySearchTree is a binary tree that is always balanced." alt="" coords="5,453,245,619"/>
</map>
