Documentation for af6e2c8991

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

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 Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -23,22 +23,6 @@
<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/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
@@ -59,22 +43,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 +91,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_source.html','../../',''); });
document.addEventListener('DOMContentLoaded',() => { initNavTree('d4/db6/reverse__binary__tree_8cpp_source.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) -->
@@ -149,7 +154,7 @@ $(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp_source.html','../../
<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50"> 65</a></span> <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* pivot) {</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">if</span> (pivot == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code hl_function" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); </div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> }</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data &lt;= pivot-&gt;</a><a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a> =</div>
@@ -179,7 +184,7 @@ $(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp_source.html','../../
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56"> 101</a></span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">BinaryTree</a>() { <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">nullptr</span>; }</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b"> 105</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b">BinaryTree</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) { <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">new</span> <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); }</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b"> 105</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b">BinaryTree</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) { <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">new</span> <a class="code hl_function" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); }</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">~BinaryTree</a>() {</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> std::vector&lt;Node*&gt; nodes;</div>
@@ -304,7 +309,7 @@ $(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp_source.html','../../
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span>} <span class="comment">// namespace tests</span></div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span></div>
<div class="foldopen" id="foldopen00260" data-start="{" data-end="}">
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"><a class="line" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 260</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"><a class="line" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 260</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>(); </div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>(); </div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>(); </div>
@@ -312,11 +317,12 @@ $(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp_source.html','../../
</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span></div>
<div class="foldopen" id="foldopen00270" data-start="{" data-end="}">
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"><a class="line" href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 270</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</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="l00270" name="l00270"></a><span class="lineno"><a class="line" href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 270</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00271" name="l00271"></a><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"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span>}</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 class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></div><div class="ttdoc">A Binary Tree class that implements a Binary Search Tree (BST) by default.</div><div class="ttdef"><b>Definition</b> <a href="#l00052">reverse_binary_tree.cpp:52</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a1c0d27198372b36ef71bc58af8336b9c"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse</a></div><div class="ttdeci">void reverse()</div><div class="ttdef"><b>Definition</b> <a href="#l00128">reverse_binary_tree.cpp:128</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a2e683b271d8d5cd63e0d09cf8aaa325c"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; get_level_order()</div><div class="ttdoc">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....</div><div class="ttdef"><b>Definition</b> <a href="#l00139">reverse_binary_tree.cpp:139</a></div></div>
@@ -327,6 +333,7 @@ $(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp_source.html','../../
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_abcb1cc8da7b6759dc92cbe0254697c56"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree</a></div><div class="ttdeci">BinaryTree()</div><div class="ttdoc">Creates a BinaryTree with a root pointing to NULL.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">reverse_binary_tree.cpp:101</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_adb2b6be741b0500ee75d89b6d06b5d50"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</a></div><div class="ttdeci">Node * insert(int64_t data, Node *pivot)</div><div class="ttdoc">inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00065">reverse_binary_tree.cpp:65</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_af6f974381f523fdb981fc2d843bbf4a1"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</a></div><div class="ttdeci">Node * reverseBinaryTree(Node *pivot)</div><div class="ttdoc">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.</div><div class="ttdef"><b>Definition</b> <a href="#l00084">reverse_binary_tree.cpp:84</a></div></div>
<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
<div class="ttc" id="anamespacereverse__binary__tree_html"><div class="ttname"><a href="../../dc/dc5/namespacereverse__binary__tree.html">reverse_binary_tree</a></div><div class="ttdoc">Functions for the Reverse a Binary Tree implementation.</div></div>
@@ -334,8 +341,6 @@ $(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp_source.html','../../
<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">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></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 an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></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 empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></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> <a href="#l00260">reverse_binary_tree.cpp:260</a></div></div>
<div class="ttc" id="areverse__binary__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00270">reverse_binary_tree.cpp:270</a></div></div>
<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">operations_on_datastructures::reverse_binary_tree::Node</a></div><div class="ttdoc">A Node struct that represents a single node in a Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">reverse_binary_tree.cpp:34</a></div></div>
<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_a15dd7a0a7d9b1e8b2012c5161aecd6e3"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">operations_on_datastructures::reverse_binary_tree::Node::Node</a></div><div class="ttdeci">Node(int64_t _data)</div><div class="ttdoc">Creates a new Node with some initial data.</div><div class="ttdef"><b>Definition</b> <a href="#l00041">reverse_binary_tree.cpp:41</a></div></div>
<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ab13a4dd92d54c11eca86edde3ef32256"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">operations_on_datastructures::reverse_binary_tree::Node::right</a></div><div class="ttdeci">Node * right</div><div class="ttdoc">The Node&#39;s right child.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">reverse_binary_tree.cpp:37</a></div></div>
@@ -347,8 +352,8 @@ $(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp_source.html','../../
<!-- 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>