backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-11-04 06:45:45 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for af6e2c8991

Browse Source
This commit is contained in:
realstealthninja
2026-09-21 04:13:18 +00:00
parent fa852a6801
commit cc04e74d11
2789 changed files with 66741 additions and 46802 deletions
Download Patch File Download Diff File Expand all files Collapse all files

85
d4/db6/reverse__binary__tree_8cpp.html
View File

@@ -4,7 +4,7 @@
<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.14.0"/>
<meta name="generator" content="Doxygen 1.18.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: operations_on_datastructures/reverse_binary_tree.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -59,22 +59,47 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<!-- Generated by Doxygen 1.18.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
let searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
document.addEventListener('DOMContentLoaded', codefold.init);
</script>
<script type="application/json" id="doxygen-config">
{
"relPath": "../../",
"generateTreeView": true,
"searchEngine": true,
"serverBasedSearch": false,
"disableIndex": false,
"dynamicMenus": true,
"fullSidebar": false
}
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
<div id="main-nav-mobile">
<div class="sm sm-dox"><input id="main-menu-state" type="checkbox"/>
<label class="main-menu-btn" for="main-menu-state">
<span class="main-menu-btn-icon"></span> Toggle main menu visibility</label>
<span id="searchBoxPos1"></span>
</div>
</div><!-- main-nav-mobile -->
<div id="main-nav">
<ul class="sm sm-dox" id="main-menu">
<li id="searchBoxPos2">
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<span id="MSearchSelect" class="search-icon"><span class="search-icon-dropdown"></span></span>
<input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><div id="MSearchCloseImg" class="close-icon"></div></a>
</span>
</div>
</li>
</ul>
</div><!-- main-nav -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
@@ -82,20 +107,16 @@ $(function() {
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
<div id="splitbar" class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp.html','../../',''); });
document.addEventListener('DOMContentLoaded',() => { initNavTree('d4/db6/reverse__binary__tree_8cpp.html','../../',''); });
</script>
<div id="container">
<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 id="MSearchSelectWindow">
</div>
<!-- iframe showing the search results (closed by default) -->
@@ -133,31 +154,31 @@ Include dependency graph for reverse_binary_tree.cpp:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:operations_5Fon_5Fdatastructures_3A_3Areverse_5Fbinary_5Ftree_3A_3ANode" id="r_operations_5Fon_5Fdatastructures_3A_3Areverse_5Fbinary_5Ftree_3A_3ANode"><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="memitem:operations_5Fon_5Fdatastructures_3A_3Areverse_5Fbinary_5Ftree_3A_3ANode" id="r_operations_5Fon_5Fdatastructures_3A_3Areverse_5Fbinary_5Ftree_3A_3ANode"><td class="memItemLeft">struct &#160;</td><td class="memItemRight"><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="memitem:operations_5Fon_5Fdatastructures_3A_3Areverse_5Fbinary_5Ftree_3A_3ABinaryTree" id="r_operations_5Fon_5Fdatastructures_3A_3Areverse_5Fbinary_5Ftree_3A_3ABinaryTree"><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="memitem:operations_5Fon_5Fdatastructures_3A_3Areverse_5Fbinary_5Ftree_3A_3ABinaryTree" id="r_operations_5Fon_5Fdatastructures_3A_3Areverse_5Fbinary_5Ftree_3A_3ABinaryTree"><td class="memItemLeft">class &#160;</td><td class="memItemRight"><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>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:operations_5Fon_5Fdatastructures" id="r_operations_5Fon_5Fdatastructures"><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="memitem:operations_5Fon_5Fdatastructures" id="r_operations_5Fon_5Fdatastructures"><td class="memItemLeft">namespace &#160;</td><td class="memItemRight"><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 std::vector <br /></td></tr>
<tr class="memitem:reverse_5Fbinary_5Ftree" id="r_reverse_5Fbinary_5Ftree"><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="memitem:reverse_5Fbinary_5Ftree" id="r_reverse_5Fbinary_5Ftree"><td class="memItemLeft">namespace &#160;</td><td class="memItemRight"><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="memitem:tests" id="r_tests"><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="memitem:tests" id="r_tests"><td class="memItemLeft">namespace &#160;</td><td class="memItemRight"><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 Union of Two Arrays. <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a167c24bd817469ae47358d12e034f2d5" id="r_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="memitem:a167c24bd817469ae47358d12e034f2d5" id="r_a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft">void&#160;</td><td class="memItemRight"><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">A Test to check an simple case. <br /></td></tr>
<tr class="memitem:abdd77344d4af8fd56d14a5cabbf2f669" id="r_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="memitem:abdd77344d4af8fd56d14a5cabbf2f669" id="r_abdd77344d4af8fd56d14a5cabbf2f669"><td class="memItemLeft">void&#160;</td><td class="memItemRight"><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 empty vector. <br /></td></tr>
<tr class="memitem:aa515639572647508b94986489aab6d76" id="r_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="memitem:aa515639572647508b94986489aab6d76" id="r_aa515639572647508b94986489aab6d76"><td class="memItemLeft">void&#160;</td><td class="memItemRight"><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 an invalid shift value. <br /></td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#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. <br /></td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft">int&#160;</td><td class="memItemRight"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">main function <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
@@ -186,10 +207,10 @@ Functions</h2></td></tr>
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00270">270</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 270</span> {</div>
<div class="line"><span class="lineno"> 271</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 271</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 272</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 273</span>}</div>
<div class="ttc" id="areverse__binary__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#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> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00260">reverse_binary_tree.cpp:260</a></div></div>
<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -246,8 +267,8 @@ Functions</h2></td></tr>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a 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.14.0 </li>
<li class="navelem"><b>operations_on_datastructures</b></li><li class="navelem"><a 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.18.0 </li>
</ul>
</div>
</body>