mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-12 03:28:29 +08:00
29 lines
1.3 KiB
XML
29 lines
1.3 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 7.0.6 (20230106.0513)
|
|
-->
|
|
<!-- Title: binary_search_tree::find_min Pages: 1 -->
|
|
<svg width="107pt" height="56pt"
|
|
viewBox="0.00 0.00 107.00 56.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
|
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52)">
|
|
<title>binary_search_tree::find_min</title>
|
|
<!-- Node1 -->
|
|
<g id="node1" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_node1"><a xlink:title="Find the smallest value in the BST.">
|
|
<polygon fill="#999999" stroke="#666666" points="99,-30 0,-30 0,0 99,0 99,-30"/>
|
|
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
|
|
<text text-anchor="middle" x="49.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node1 -->
|
|
<g id="edge1" class="edge">
|
|
<title>Node1->Node1</title>
|
|
<path fill="none" stroke="#63b8ff" d="M32.1,-30.28C28.23,-39.41 34.03,-48 49.5,-48 57.96,-48 63.53,-45.43 66.2,-41.61"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.69,-41.98 66.81,-31.79 62.7,-41.55 69.69,-41.98"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|