backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity
Files
42c0cd0dd91c20102c367e5b44a17a19d9c10cf1
C-Plus-Plus/d4/db6/reverse__binary__tree_8cpp_source.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

356 lines
59 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.12.0-->
<!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" lang="en-US">
<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="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" />
<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>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.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/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>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</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><!-- 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">
$(function(){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>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">reverse_binary_tree.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d4/db6/reverse__binary__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span> </div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include &lt;queue&gt;</span> </div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;vector&gt;</span> </div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dc/dc5/namespacereverse__binary__tree.html">reverse_binary_tree</a> {</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span></div>
<div class="foldopen" id="foldopen00034" data-start="{" data-end="};">
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html"> 34</a></span><span class="keyword">struct </span><a class="code hl_function" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">Node</a> {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f"> 35</a></span> int64_t <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">data</a>; </div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352"> 36</a></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="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a>; </div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256"> 37</a></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="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a>; </div>
<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3"> 41</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">Node</a>(int64_t _data) {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">data</a> = _data; </div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a> = <span class="keyword">nullptr</span>; </div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> = <span class="keyword">nullptr</span>; </div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> }</div>
</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span>};</div>
</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span></div>
<div class="foldopen" id="foldopen00052" data-start="{" data-end="};">
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html"> 52</a></span><span class="keyword">class </span>BinaryTree {</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb"> 54</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_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>; </div>
<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="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>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, 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>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> =</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a>); </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> }</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">return</span> pivot;</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span></div>
<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1"> 84</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#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</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="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (pivot == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">return</span> pivot; </div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> }</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* temp = 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>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</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> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a>); </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(temp); </div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> pivot;</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> }</div>
</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">BinaryTree</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a>&amp;) = <span class="keyword">delete</span>;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a>&amp;) = <span class="keyword">delete</span>;</div>
<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="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>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> nodes.emplace_back(root);</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keywordflow">while</span> (!nodes.empty()) {</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keyword">const</span> <span class="keyword">auto</span> cur_node = nodes.back();</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> nodes.pop_back();</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">if</span> (cur_node) {</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> nodes.emplace_back(cur_node-&gt;left);</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> nodes.emplace_back(cur_node-&gt;right);</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="keyword">delete</span> cur_node;</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> }</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> }</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span></div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d"> 124</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</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> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<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>); }</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c"> 128</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a>() { <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c"> 139</a></span> std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>() {</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> std::vector&lt;int64_t&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; </div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordflow">if</span> (<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="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; </div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> }</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> std::queue&lt;Node*&gt; nodes; </div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> nodes.push(<a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); </div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordflow">while</span> (!nodes.empty()) {</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* temp = nodes.front(); </div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">data</a>); </div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> nodes.pop(); </div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">if</span> (temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a> != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> nodes.push(temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a>); </div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> }</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">if</span> (temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> nodes.push(temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a>); </div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> }</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> } </div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> }</div>
</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span></div>
<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503"> 164</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>() {</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>()) {</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>; </div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> }</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>; </div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> }</div>
</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span>};</div>
</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> </div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span>} <span class="comment">// namespace reverse_binary_tree</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span>} <span class="comment">// namespace operations_on_datastructures</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a> {</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span><span class="keyword">using </span>operations_on_datastructures::reverse_binary_tree::</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> BinaryTree; </div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">test1</a>() {</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> BinaryTree bst;</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> std::vector&lt;int64_t&gt; pre_reversal, post_reversal;</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Initializing tree with a single element (5)\n&quot;</span>;</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(5);</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> pre_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> std::cout &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a>();</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> post_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> assert(pre_reversal.size() ==</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> post_reversal.size()); </div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> assert(pre_reversal.size() ==</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> 1); </div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> assert(pre_reversal[0] ==</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> post_reversal[0]); </div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span>}</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a>() {</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> BinaryTree bst;</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> std::vector&lt;int64_t&gt; pre_reversal, post_reversal;</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Creating empty tree (root points to NULL)\n&quot;</span>;</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> pre_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> std::cout &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a>();</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> post_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> assert(pre_reversal.size() ==</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> post_reversal.size()); </div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> assert(pre_reversal.size() ==</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> 0); </div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span>}</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a>() {</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> BinaryTree bst;</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> std::vector&lt;int64_t&gt; pre_reversal, post_reversal;</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> std::vector&lt;int64_t&gt; pre_res = {4, 3, 6, 2, 5, 7, 1};</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> std::vector&lt;int64_t&gt; post_res = {4, 6, 3, 7, 5, 2, 1};</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Creating tree with elements (4, 6, 3, 2, 5, 7, 1)\n&quot;</span>;</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(4);</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(6);</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(3);</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(2);</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(5);</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(7);</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(1);</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> pre_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> assert(pre_reversal == pre_res); </div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> std::cout &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a>();</div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> post_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> assert(post_reversal == post_res); </div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span>}</div>
<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="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>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span>}</div>
</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="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="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>
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a534645d1aabdf1a7e5897c85376f173d"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">operations_on_datastructures::reverse_binary_tree::BinaryTree::add</a></div><div class="ttdeci">void add(int64_t data)</div><div class="ttdoc">Adds a new Node to the Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00124">reverse_binary_tree.cpp:124</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a5cf972a2c994a4fa1a89fc77bd5ad503"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">operations_on_datastructures::reverse_binary_tree::BinaryTree::print</a></div><div class="ttdeci">void print()</div><div class="ttdoc">Prints all of the elements in the tree to stdout level-by-level, using the get_level_order() function...</div><div class="ttdef"><b>Definition</b> <a href="#l00164">reverse_binary_tree.cpp:164</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_ab6a17a04aa93aaaef71e038e8cc2edeb"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">operations_on_datastructures::reverse_binary_tree::BinaryTree::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to root node of Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00054">reverse_binary_tree.cpp:54</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_abb44646a26a446efae7704c80efc011b"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b">operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree</a></div><div class="ttdeci">BinaryTree(int64_t data)</div><div class="ttdoc">Creates a BinaryTree with a root with an initial value.</div><div class="ttdef"><b>Definition</b> <a href="#l00105">reverse_binary_tree.cpp:105</a></div></div>
<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="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>
<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></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">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>
<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ae54953a75091532303bb08d55087077f"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value of the Node.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">reverse_binary_tree.cpp:35</a></div></div>
<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_aeb01a65e51df1e3bc5296cde8477c352"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">operations_on_datastructures::reverse_binary_tree::Node::left</a></div><div class="ttdeci">Node * left</div><div class="ttdoc">The Node&#39;s left child.</div><div class="ttdef"><b>Definition</b> <a href="#l00036">reverse_binary_tree.cpp:36</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
</div><!-- container -->
<!-- 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>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink