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 2.49.1 (20210923.0004)
 -->
<!-- Title: data_structures/binary_search_tree.cpp Pages: 1 -->
<svg width="123pt" height="95pt"
 viewBox="0.00 0.00 123.00 95.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 91)">
<title>data_structures/binary_search_tree.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 119,-91 119,4 -4,4"/>
<!-- 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="#bfbfbf" stroke="black" points="0,-56.5 0,-86.5 115,-86.5 115,-56.5 0,-56.5"/>
<text text-anchor="start" x="8" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/binary</text>
<text text-anchor="middle" x="57.5" y="-63.5" 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="white" stroke="#bfbfbf" points="30,-0.5 30,-19.5 85,-19.5 85,-0.5 30,-0.5"/>
<text text-anchor="middle" x="57.5" y="-7.5" 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="midnightblue" d="M57.5,-56.4C57.5,-48.47 57.5,-38.46 57.5,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="61,-29.66 57.5,-19.66 54,-29.66 61,-29.66"/>
</g>
</g>
</svg>