mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-11 11:07:27 +08:00
30 lines
1.4 KiB
XML
30 lines
1.4 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 2.49.1 (20210923.0004)
|
|
-->
|
|
<!-- Title: binary_search_tree::find_min Pages: 1 -->
|
|
<svg width="110pt" height="57pt"
|
|
viewBox="0.00 0.00 110.00 57.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 53)">
|
|
<title>binary_search_tree::find_min</title>
|
|
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 106,-53 106,4 -4,4"/>
|
|
<!-- Node1 -->
|
|
<g id="node1" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_node1"><a xlink:title="Recursive function to find the minimum value in the BST.">
|
|
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 102,-30.5 102,-0.5 0,-0.5"/>
|
|
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
|
|
<text text-anchor="middle" x="51" y="-7.5" 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="midnightblue" d="M33.22,-30.66C28.94,-40.06 34.86,-49 51,-49 60.83,-49 66.87,-45.68 69.12,-40.96"/>
|
|
<polygon fill="midnightblue" stroke="midnightblue" points="72.61,-40.53 68.78,-30.66 65.62,-40.77 72.61,-40.53"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|