backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-31 01:02:46 +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

243
d4/db6/reverse__binary__tree_8cpp.html Normal file
View File

@@ -0,0 +1,243 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures/reverse_binary_tree.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">reverse_binary_tree.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reversing a Binary Tree</a> recursively algorithm.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;queue&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for reverse_binary_tree.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/de3/reverse__binary__tree_8cpp__incl.svg" width="340" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">operations_on_datastructures::reverse_binary_tree::Node</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A <a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree. <a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Binary Tree class that implements a Binary Search Tree (BST) by default. <a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:da/d6d/namespaceoperations__on__datastructures"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:dc/dc5/namespacereverse__binary__tree"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/dc5/namespacereverse__binary__tree.html">reverse_binary_tree</a></td></tr>
<tr class="memdesc:dc/dc5/namespacereverse__binary__tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reverse a Binary Tree</a> implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d9/df4/namespacetests"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html">tests</a></td></tr>
<tr class="memdesc:d9/df4/namespacetests"><td class="mdescLeft">&#160;</td><td class="mdescRight">Testcases to check Reversal of Binary Tree. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a> ()</td></tr>
<tr class="memdesc:a167c24bd817469ae47358d12e034f2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; Use the BinaryTree <a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">More...</a><br /></td></tr>
<tr class="separator:a167c24bd817469ae47358d12e034f2d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abdd77344d4af8fd56d14a5cabbf2f669"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a> ()</td></tr>
<tr class="memdesc:abdd77344d4af8fd56d14a5cabbf2f669"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an edge case (NULL root element) <a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">More...</a><br /></td></tr>
<tr class="separator:abdd77344d4af8fd56d14a5cabbf2f669"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa515639572647508b94986489aab6d76"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a> ()</td></tr>
<tr class="memdesc:aa515639572647508b94986489aab6d76"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct reversal of a Binary Tree. <a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">More...</a><br /></td></tr>
<tr class="separator:aa515639572647508b94986489aab6d76"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the correctness of the Tree Reversal. <a href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">main function <a href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reversing a Binary Tree</a> recursively algorithm. </p>
<p >A binary tree can be reversed by swapping the left and right child of a node at each node, starting from the root, and cascading below. This solution aims to provide an implementation of a recursive reversal of a binary tree. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>main function </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> {</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <a class="code hl_function" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span>}</div>
<div class="ttc" id="areverse__binary__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of the Tree Reversal.</div><div class="ttdef"><b>Definition:</b> reverse_binary_tree.cpp:242</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="451" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&nbsp;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to test the correctness of the Tree Reversal. </p>
<p >&lt; Single element test</p>
<p >&lt; No element test</p>
<p >&lt; Correct reversal test</p>
<div class="fragment"><div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> {</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>(); <span class="comment">///&lt; Single element test</span></div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>(); <span class="comment">///&lt; No element test</span></div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>(); <span class="comment">///&lt; Correct reversal test</span></div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span>}</div>
<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">&lt; Use the BinaryTree</div><div class="ttdef"><b>Definition:</b> reverse_binary_tree.cpp:167</div></div>
<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check correct reversal of a Binary Tree.</div><div class="ttdef"><b>Definition:</b> reverse_binary_tree.cpp:212</div></div>
<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an edge case (NULL root element)</div><div class="ttdef"><b>Definition:</b> reverse_binary_tree.cpp:191</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="352" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html">reverse_binary_tree.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.2 </li>
</ul>
</div>
</body>
</html>

10
d4/db6/reverse__binary__tree_8cpp.js Normal file
View File

@@ -0,0 +1,10 @@
var reverse__binary__tree_8cpp =
[
[ "operations_on_datastructures::reverse_binary_tree::Node", "d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html", "d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node" ],
[ "operations_on_datastructures::reverse_binary_tree::BinaryTree", "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html", "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree" ],
[ "main", "d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ],
[ "test1", "d4/db6/reverse__binary__tree_8cpp.html#a167c24bd817469ae47358d12e034f2d5", null ],
[ "test2", "d4/db6/reverse__binary__tree_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669", null ],
[ "test3", "d4/db6/reverse__binary__tree_8cpp.html#aa515639572647508b94986489aab6d76", null ]
];

7
d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Function to test the correctness of the Tree Reversal." alt="" coords="5,56,49,83"/>
<area shape="rect" id="node2" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="&lt; Use the BinaryTree" alt="" coords="97,5,184,32"/>
<area shape="rect" id="node4" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an edge case (NULL root element)" alt="" coords="97,56,184,83"/>
<area shape="rect" id="node5" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check correct reversal of a Binary Tree." alt="" coords="97,107,184,133"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="232,31,347,57"/>
</map>

1
d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
032e1fa8d12e347f799acaf916fb3b6d

88
d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg Normal file
View File

@@ -0,0 +1,88 @@
<?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: test Pages: 1 -->
<svg width="264pt" height="104pt"
viewBox="0.00 0.00 264.00 104.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 100)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-100 260,-100 260,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Function to test the correctness of the Tree Reversal.">
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 33,-57.5 33,-38.5 0,-38.5"/>
<text text-anchor="middle" x="16.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="&lt; Use the BinaryTree">
<polygon fill="white" stroke="black" points="69,-76.5 69,-95.5 134,-95.5 134,-76.5 69,-76.5"/>
<text text-anchor="middle" x="101.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</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="M33.11,-55.15C43.59,-59.94 57.73,-66.42 70.36,-72.2"/>
<polygon fill="midnightblue" stroke="midnightblue" points="69.08,-75.46 79.63,-76.44 71.99,-69.1 69.08,-75.46"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an edge case (NULL root element)">
<polygon fill="white" stroke="black" points="69,-38.5 69,-57.5 134,-57.5 134,-38.5 69,-38.5"/>
<text text-anchor="middle" x="101.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</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="M33.11,-48C40.41,-48 49.49,-48 58.6,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.8,-51.5 68.8,-48 58.8,-44.5 58.8,-51.5"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check correct reversal of a Binary Tree.">
<polygon fill="white" stroke="black" points="69,-0.5 69,-19.5 134,-19.5 134,-0.5 69,-0.5"/>
<text text-anchor="middle" x="101.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M33.11,-40.85C43.59,-36.06 57.73,-29.58 70.36,-23.8"/>
<polygon fill="midnightblue" stroke="midnightblue" points="71.99,-26.9 79.63,-19.56 69.08,-20.54 71.99,-26.9"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="170,-57.5 170,-76.5 256,-76.5 256,-57.5 170,-57.5"/>
<text text-anchor="middle" x="213" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M134.17,-80.5C142.16,-79.12 150.95,-77.59 159.67,-76.08"/>
<polygon fill="midnightblue" stroke="midnightblue" points="160.55,-79.48 169.8,-74.32 159.35,-72.58 160.55,-79.48"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M134.17,-53.5C142.16,-54.88 150.95,-56.41 159.67,-57.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="159.35,-61.42 169.8,-59.68 160.55,-54.52 159.35,-61.42"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.2 KiB

8
d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,8 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="main function" alt="" coords="5,56,56,83"/>
<area shape="rect" id="node2" href="$d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the correctness of the Tree Reversal." alt="" coords="104,56,148,83"/>
<area shape="rect" id="node3" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="&lt; Use the BinaryTree" alt="" coords="196,5,283,32"/>
<area shape="rect" id="node5" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an edge case (NULL root element)" alt="" coords="196,56,283,83"/>
<area shape="rect" id="node6" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check correct reversal of a Binary Tree." alt="" coords="196,107,283,133"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="331,31,445,57"/>
</map>

1
d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
81c211f6003bcb1f42078a511f34fc43

103
d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,103 @@
<?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: main Pages: 1 -->
<svg width="338pt" height="104pt"
viewBox="0.00 0.00 338.00 104.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 100)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-100 334,-100 334,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="main function">
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 38,-57.5 38,-38.5 0,-38.5"/>
<text text-anchor="middle" x="19" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of the Tree Reversal.">
<polygon fill="white" stroke="black" points="74,-38.5 74,-57.5 107,-57.5 107,-38.5 74,-38.5"/>
<text text-anchor="middle" x="90.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</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="M38.26,-48C46.07,-48 55.31,-48 63.79,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-51.5 73.95,-48 63.95,-44.5 63.95,-51.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="&lt; Use the BinaryTree">
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 208,-95.5 208,-76.5 143,-76.5"/>
<text text-anchor="middle" x="175.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M107.11,-55.15C117.59,-59.94 131.73,-66.42 144.36,-72.2"/>
<polygon fill="midnightblue" stroke="midnightblue" points="143.08,-75.46 153.63,-76.44 145.99,-69.1 143.08,-75.46"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an edge case (NULL root element)">
<polygon fill="white" stroke="black" points="143,-38.5 143,-57.5 208,-57.5 208,-38.5 143,-38.5"/>
<text text-anchor="middle" x="175.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M107.11,-48C114.41,-48 123.49,-48 132.6,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.8,-51.5 142.8,-48 132.8,-44.5 132.8,-51.5"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check correct reversal of a Binary Tree.">
<polygon fill="white" stroke="black" points="143,-0.5 143,-19.5 208,-19.5 208,-0.5 143,-0.5"/>
<text text-anchor="middle" x="175.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge6" class="edge">
<title>Node2&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M107.11,-40.85C117.59,-36.06 131.73,-29.58 144.36,-23.8"/>
<polygon fill="midnightblue" stroke="midnightblue" points="145.99,-26.9 153.63,-19.56 143.08,-20.54 145.99,-26.9"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="244,-57.5 244,-76.5 330,-76.5 330,-57.5 244,-57.5"/>
<text text-anchor="middle" x="287" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M208.17,-80.5C216.16,-79.12 224.95,-77.59 233.67,-76.08"/>
<polygon fill="midnightblue" stroke="midnightblue" points="234.55,-79.48 243.8,-74.32 233.35,-72.58 234.55,-79.48"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M208.17,-53.5C216.16,-54.88 224.95,-56.41 233.67,-57.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="233.35,-61.42 243.8,-59.68 234.55,-54.52 233.35,-61.42"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.0 KiB