<map id="data_structures/binary_search_tree2.cpp" name="data_structures/binary_search_tree2.cpp">
<area shape="rect" id="node1" title="A generic binary search tree implementation. Here you can find more information about the algorithm: ..." alt="" coords="159,5,309,45"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,93,71,119"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,93,173,119"/>
<area shape="rect" id="node4" title=" " alt="" coords="198,93,270,119"/>
<area shape="rect" id="node5" title=" " alt="" coords="294,93,363,119"/>
<area shape="rect" id="node6" title=" " alt="" coords="387,93,446,119"/>
</map>
