mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-31 09:13:16 +08:00
118 lines
5.5 KiB
XML
118 lines
5.5 KiB
XML
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
|
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
|
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
|
<!-- Generated by graphviz version 12.2.1 (20241206.2353)
|
|
-->
|
|
<!-- Title: binary_search_tree< T > Pages: 1 -->
|
|
<svg width="248pt" height="128pt"
|
|
viewBox="0.00 0.00 247.50 127.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
|
|
|
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
|
|
|
<style type="text/css"><![CDATA[
|
|
.node, .edge {opacity: 0.7;}
|
|
.node.selected, .edge.selected {opacity: 1;}
|
|
.edge:hover path { stroke: red; }
|
|
.edge:hover polygon { stroke: red; fill: red; }
|
|
]]></style>
|
|
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
|
<svg id="graph" class="graph">
|
|
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 123.5)">
|
|
<title>binary_search_tree< T ></title>
|
|
<!-- Node1 -->
|
|
<g id="Node000001" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_Node000001"><a xlink:title="The Binary Search Tree class.">
|
|
<polygon fill="#999999" stroke="#666666" points="122.5,-24.88 0,-24.88 0,-5.63 122.5,-5.63 122.5,-24.88"/>
|
|
<text text-anchor="middle" x="61.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree< T ></text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node2 -->
|
|
<g id="Node000002" class="node">
|
|
<title>Node2</title>
|
|
<g id="a_Node000002"><a xlink:title=" ">
|
|
<polygon fill="white" stroke="#666666" points="175.75,-119.5 48.75,-119.5 48.75,-89 175.75,-89 175.75,-119.5"/>
|
|
<text text-anchor="start" x="56.75" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr< binary</text>
|
|
<text text-anchor="middle" x="112.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search_tree::bst_node ></text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node2->Node1 -->
|
|
<g id="edge1_Node000001_Node000002" class="edge">
|
|
<title>Node2->Node1</title>
|
|
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
|
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M88.23,-80.22C85.78,-77.25 83.47,-74.15 81.5,-71 72.27,-56.21 66.3,-36.58 63.38,-25.29"/>
|
|
<polygon fill="#9a32cd" stroke="#9a32cd" points="85.5,-82.42 94.82,-87.47 90.69,-77.71 85.5,-82.42"/>
|
|
</a>
|
|
</g>
|
|
<text text-anchor="middle" x="93.88" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> root_</text>
|
|
</g>
|
|
<!-- Node3 -->
|
|
<g id="Node000003" class="node">
|
|
<title>Node3</title>
|
|
<g id="a_Node000003"><a xlink:href="../../dd/db6/structbinary__search__tree_1_1bst__node.html" target="_top" xlink:title="A struct to represent a node in the Binary Search Tree.">
|
|
<polygon fill="white" stroke="#666666" points="239.5,-30.5 141,-30.5 141,0 239.5,0 239.5,-30.5"/>
|
|
<text text-anchor="start" x="149" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
|
|
<text text-anchor="middle" x="190.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">< T >::bst_node</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node2->Node3 -->
|
|
<g id="edge4_Node000003_Node000002" class="edge">
|
|
<title>Node2->Node3</title>
|
|
<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
|
|
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M114.43,-77.41C116.36,-67.52 119.93,-56.65 126.5,-48.5 132.34,-41.26 140.23,-35.49 148.47,-30.96"/>
|
|
<polygon fill="#9a32cd" stroke="#9a32cd" points="110.97,-76.87 113.01,-87.26 117.9,-77.86 110.97,-76.87"/>
|
|
</a>
|
|
</g>
|
|
<text text-anchor="middle" x="135.88" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
|
|
<text text-anchor="middle" x="135.88" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
|
|
</g>
|
|
<!-- Node3->Node2 -->
|
|
<g id="edge2_Node000002_Node000003" class="edge">
|
|
<title>Node3->Node2</title>
|
|
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
|
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M174.03,-40.16C166.88,-50.08 158.1,-61.47 149.25,-71 143.57,-77.12 136.81,-83.28 130.64,-88.55"/>
|
|
<polygon fill="#9a32cd" stroke="#9a32cd" points="176.81,-42.28 179.71,-32.09 171.09,-38.25 176.81,-42.28"/>
|
|
</a>
|
|
</g>
|
|
<text text-anchor="middle" x="174.35" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
|
|
</g>
|
|
<!-- Node4 -->
|
|
<g id="Node000004" class="node">
|
|
<title>Node4</title>
|
|
<g id="a_Node000004"><a xlink:title=" ">
|
|
<polygon fill="white" stroke="#bfbfbf" points="222.65,-113.88 193.85,-113.88 193.85,-94.62 222.65,-94.62 222.65,-113.88"/>
|
|
<text text-anchor="middle" x="208.25" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node4->Node3 -->
|
|
<g id="edge3_Node000003_Node000004" class="edge">
|
|
<title>Node4->Node3</title>
|
|
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
|
|
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M204.15,-83.45C200.84,-67.42 196.24,-45.22 193.26,-30.8"/>
|
|
<polygon fill="#9a32cd" stroke="#9a32cd" points="200.63,-83.7 206.08,-92.79 207.49,-82.28 200.63,-83.7"/>
|
|
</a>
|
|
</g>
|
|
<text text-anchor="middle" x="214.52" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> value</text>
|
|
</g>
|
|
</g>
|
|
</svg>
|
|
</svg>
|
|
|
|
<style type='text/css'>
|
|
<![CDATA[
|
|
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
|
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
|
]]>
|
|
</style>
|
|
<script type="application/ecmascript"><![CDATA[
|
|
document.addEventListener('DOMContentLoaded', (event) => {
|
|
highlightEdges();
|
|
highlightAdjacentNodes();
|
|
});
|
|
]]></script>
|
|
</svg>
|