mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 12:52:48 +08:00
83 lines
3.5 KiB
XML
83 lines
3.5 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 8.0.2 (20230410.1723)
|
|
-->
|
|
<!-- Title: operations_on_datastructures/reverse_binary_tree.cpp Pages: 1 -->
|
|
<svg width="254pt" height="93pt"
|
|
viewBox="0.00 0.00 253.50 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>operations_on_datastructures/reverse_binary_tree.cpp</title>
|
|
<!-- Node1 -->
|
|
<g id="node1" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_node1"><a xlink:title="Implementation for the Reversing a Binary Tree recursively algorithm.">
|
|
<polygon fill="#999999" stroke="#666666" points="200,-85 55,-85 55,-55 200,-55 200,-85"/>
|
|
<text text-anchor="start" x="63" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
|
<text text-anchor="middle" x="127.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">/reverse_binary_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="49,-19 0,-19 0,0 49,0 49,-19"/>
|
|
<text text-anchor="middle" x="24.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node2 -->
|
|
<g id="edge1" class="edge">
|
|
<title>Node1->Node2</title>
|
|
<path fill="none" stroke="#63b8ff" d="M102.04,-54.54C85.96,-45.4 65.28,-33.66 49.32,-24.6"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="51.5,-21.24 41.08,-19.35 48.04,-27.33 51.5,-21.24"/>
|
|
</g>
|
|
<!-- Node3 -->
|
|
<g id="node3" class="node">
|
|
<title>Node3</title>
|
|
<g id="a_node3"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="121.5,-19 67.5,-19 67.5,0 121.5,0 121.5,-19"/>
|
|
<text text-anchor="middle" x="94.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node3 -->
|
|
<g id="edge2" class="edge">
|
|
<title>Node1->Node3</title>
|
|
<path fill="none" stroke="#63b8ff" d="M119.34,-54.54C114.94,-46.74 109.46,-37.03 104.77,-28.71"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="107.36,-27.17 99.39,-20.18 101.26,-30.6 107.36,-27.17"/>
|
|
</g>
|
|
<!-- Node4 -->
|
|
<g id="node4" class="node">
|
|
<title>Node4</title>
|
|
<g id="a_node4"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="183,-19 140,-19 140,0 183,0 183,-19"/>
|
|
<text text-anchor="middle" x="161.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node4 -->
|
|
<g id="edge3" class="edge">
|
|
<title>Node1->Node4</title>
|
|
<path fill="none" stroke="#63b8ff" d="M135.9,-54.54C140.49,-46.65 146.21,-36.81 151.08,-28.44"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.46,-30.58 156.46,-20.18 148.41,-27.06 154.46,-30.58"/>
|
|
</g>
|
|
<!-- Node5 -->
|
|
<g id="node5" class="node">
|
|
<title>Node5</title>
|
|
<g id="a_node5"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="245.5,-19 201.5,-19 201.5,0 245.5,0 245.5,-19"/>
|
|
<text text-anchor="middle" x="223.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node5 -->
|
|
<g id="edge4" class="edge">
|
|
<title>Node1->Node5</title>
|
|
<path fill="none" stroke="#63b8ff" d="M151.23,-54.54C166.08,-45.49 185.13,-33.88 199.95,-24.85"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.27,-27.54 207.98,-19.35 197.62,-21.56 201.27,-27.54"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|