mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 12:52:48 +08:00
38 lines
1.6 KiB
XML
38 lines
1.6 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: data_structures/binary_search_tree.cpp Pages: 1 -->
|
|
<svg width="121pt" height="93pt"
|
|
viewBox="0.00 0.00 121.00 93.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 89)">
|
|
<title>data_structures/binary_search_tree.cpp</title>
|
|
<!-- Node1 -->
|
|
<g id="node1" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_node1"><a xlink:title="A simple tree implementation using structured nodes.">
|
|
<polygon fill="#999999" stroke="#666666" points="113,-85 0,-85 0,-55 113,-55 113,-85"/>
|
|
<text text-anchor="start" x="8" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/binary</text>
|
|
<text text-anchor="middle" x="56.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_search_tree.cpp</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node2 -->
|
|
<g id="node2" class="node">
|
|
<title>Node2</title>
|
|
<g id="a_node2"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="83.5,-19 29.5,-19 29.5,0 83.5,0 83.5,-19"/>
|
|
<text text-anchor="middle" x="56.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node2 -->
|
|
<g id="edge1" class="edge">
|
|
<title>Node1->Node2</title>
|
|
<path fill="none" stroke="#63b8ff" d="M56.5,-54.54C56.5,-47.34 56.5,-38.53 56.5,-30.68"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="60,-30.69 56.5,-20.69 53,-30.69 60,-30.69"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|