mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 06:12:11 +08:00
23 lines
1.2 KiB
XML
23 lines
1.2 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 12.1.0 (20240811.2233)
|
|
-->
|
|
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
|
<svg width="169pt" height="39pt"
|
|
viewBox="0.00 0.00 168.75 38.50" 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 34.5)">
|
|
<title>Graphical Class Hierarchy</title>
|
|
<!-- Node0 -->
|
|
<g id="Node000000" class="node">
|
|
<title>Node0</title>
|
|
<g id="a_Node000000"><a xlink:href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_top" xlink:title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">
|
|
<polygon fill="white" stroke="#666666" points="160.75,-30.5 0,-30.5 0,0 160.75,0 160.75,-30.5"/>
|
|
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
|
<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
</g>
|
|
</svg>
|