mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 04:42:10 +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 5.0.1 (20220820.1526)
|
|
-->
|
|
<!-- 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.83,-54.99C86.41,-45.66 64.95,-33.47 48.64,-24.21"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="50.13,-21.03 39.71,-19.14 46.68,-27.12 50.13,-21.03"/>
|
|
</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.51,-54.84C114.97,-46.78 109.23,-36.62 104.4,-28.06"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="107.41,-26.26 99.44,-19.27 101.31,-29.7 107.41,-26.26"/>
|
|
</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.73,-54.84C140.41,-46.78 146.32,-36.62 151.3,-28.06"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.41,-29.67 156.41,-19.27 148.35,-26.15 154.41,-29.67"/>
|
|
</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="M150.74,-54.84C165.9,-45.6 185.61,-33.59 200.69,-24.4"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.68,-27.29 209.4,-19.09 199.04,-21.31 202.68,-27.29"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|