C-Plus-Plus/d4/d0c/binary__search__tree_8cpp__incl.svg

<?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 8.0.4 (20230421.1958)
 -->
<!-- Title: data_structures/binary_search_tree.cpp Pages: 1 -->
<svg width="121pt" height="94pt"
 viewBox="0.00 0.00 120.75 93.75" 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.75)">
<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="112.75,-85.75 0,-85.75 0,-55.25 112.75,-55.25 112.75,-85.75"/>
<text text-anchor="start" x="8" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/binary</text>
<text text-anchor="middle" x="56.38" y="-61" 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.12,-19.25 29.62,-19.25 29.62,0 83.12,0 83.12,-19.25"/>
<text text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M56.38,-54.95C56.38,-47.62 56.38,-38.62 56.38,-30.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="59.88,-30.7 56.38,-20.7 52.88,-30.7 59.88,-30.7"/>
</g>
</g>
</svg>