backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-24 22:02:20 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 3406be6d0b

Browse Source
This commit is contained in:
github-actions
2021-10-19 22:01:52 +00:00
parent 419f6e8f4e
commit e4c172f067
232 changed files with 5577 additions and 2786 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::reverse_binary_tree::Node" name="operations_on_datastructures::reverse_binary_tree::Node">
<area shape="rect" id="node1" title="A Node struct that represents a single node in a Binary Tree." alt="" coords="5,5,204,47"/>
</map>

1
db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
bfa4995b3a84cf585b0534e0fbd90ca9

31
db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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: operations_on_datastructures::reverse_binary_tree::Node Pages: 1 -->
<svg width="195pt" height="39pt"
viewBox="0.00 0.00 195.00 39.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 35)">
<title>operations_on_datastructures::reverse_binary_tree::Node</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 191,-35 191,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A Node struct that represents a single node in a Binary Tree.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 149,-30.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::Node</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M159.54,-19.26C164.22,-18.35 167,-17.09 167,-15.5 167,-12.95 159.88,-11.27 149.26,-10.45"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="158.75,-15.83 149.26,-20.55 159.62,-22.78 158.75,-15.83"/>
<text text-anchor="middle" x="177" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="177" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">right</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB

7
db/de3/reverse__binary__tree_8cpp__incl.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="operations_on_datastructures/reverse_binary_tree.cpp" name="operations_on_datastructures/reverse_binary_tree.cpp">
<area shape="rect" id="node1" title="Implementation for the Reversing a Binary Tree recursively algorithm." alt="" coords="77,5,276,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,95,168,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="193,95,251,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="275,95,334,121"/>
</map>

1
db/de3/reverse__binary__tree_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
00563001af3cac291d944ae12b653fb0

83
db/de3/reverse__binary__tree_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,83 @@
<?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: operations_on_datastructures/reverse_binary_tree.cpp Pages: 1 -->
<svg width="255pt" height="95pt"
viewBox="0.00 0.00 254.50 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>operations_on_datastructures/reverse_binary_tree.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 250.5,-91 250.5,4 -4,4"/>
<!-- 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="#bfbfbf" stroke="black" points="54,-56.5 54,-86.5 203,-86.5 203,-56.5 54,-56.5"/>
<text text-anchor="start" x="62" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="128.5" y="-63.5" 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="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</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="M103.85,-56.4C87.18,-46.86 65.27,-34.32 48.69,-24.84"/>
<polygon fill="midnightblue" stroke="midnightblue" points="50.05,-21.59 39.63,-19.66 46.57,-27.66 50.05,-21.59"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67,-0.5 67,-19.5 122,-19.5 122,-0.5 67,-0.5"/>
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M120.44,-56.4C115.65,-48.02 109.54,-37.33 104.46,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="107.45,-26.6 99.45,-19.66 101.37,-30.08 107.45,-26.6"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="140.5,-0.5 140.5,-19.5 184.5,-19.5 184.5,-0.5 140.5,-0.5"/>
<text text-anchor="middle" x="162.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M136.56,-56.4C141.35,-48.02 147.46,-37.33 152.54,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="155.63,-30.08 157.55,-19.66 149.55,-26.6 155.63,-30.08"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="202.5,-0.5 202.5,-19.5 246.5,-19.5 246.5,-0.5 202.5,-0.5"/>
<text text-anchor="middle" x="224.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M151.25,-56.4C166.49,-46.95 186.49,-34.56 201.74,-25.11"/>
<polygon fill="midnightblue" stroke="midnightblue" points="203.88,-27.9 210.53,-19.66 200.19,-21.95 203.88,-27.9"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.7 KiB