backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity
Files
14583a2f33720eba2e2786d75e8e2312b85fa667
C-Plus-Plus/dc/de1/recursive__tree__traversal_8cpp_source.html
realstealthninja 14583a2f33 Documentation for c26eea874d
2025-05-19 11:38:33 +00:00

457 lines
69 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.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: others/recursive_tree_traversal.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="../../resize.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.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('dc/de1/recursive__tree__traversal_8cpp_source.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<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">recursive_tree_traversal.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../dc/de1/recursive__tree__traversal_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="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="preprocessor">#include &lt;cstdint&gt;</span> </div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="preprocessor">#include &lt;vector&gt;</span> </div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span><span class="keyword">namespace </span>recursive_tree_traversals {</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span></div>
<div class="foldopen" id="foldopen00079" data-start="{" data-end="};">
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html"> 79</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> {</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade"> 80</a></span> std::uint64_t <a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">data</a> = 0; </div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3"> 81</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>{}; </div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83"> 82</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>{}; </div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span>};</div>
</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span></div>
<div class="foldopen" id="foldopen00088" data-start="{" data-end="};">
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html"> 88</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">BT</a> {</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> inorder_result; <span class="comment">// vector to store the inorder traversal of the tree.</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> preorder_result; <span class="comment">// vector to store the preorder traversal of the tree.</span></div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> postorder_result; <span class="comment">// vector to store the preorder</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// traversal of the tree.</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> std::uint64_t); <span class="comment">// function that will create new node for insertion.</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> </div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> std::vector&lt;std::uint64_t&gt; inorder(</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *); <span class="comment">// function that takes root of the tree as an argument and</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// returns its inorder traversal.</span></div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> std::vector&lt;std::uint64_t&gt; <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *); <span class="comment">// function that takes root of the tree as an argument and</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// returns its preorder traversal.</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> std::vector&lt;std::uint64_t&gt; <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *); <span class="comment">// function that takes root of the tree as an argument and</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// returns its postorder traversal.</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span>};</div>
</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span></div>
<div class="foldopen" id="foldopen00118" data-start="{" data-end="}">
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"><a class="line" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114"> 118</a></span><a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">BT::createNewNode</a>(std::uint64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a>();</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span>}</div>
</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span><span class="comment">/*</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span><span class="comment"> * @brief inorder() function that will perform the inorder traversal</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span><span class="comment"> * recursively, and return the resultant vector that contain the inorder</span></div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span><span class="comment"> * traversal of a tree.</span></div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment"> * @param root head/root node of a tree</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment"> * @return result that is containing the inorder traversal of a tree</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment"> **/</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span>std::vector&lt;std::uint64_t&gt; BT::inorder(<a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *root) {</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) { <span class="comment">// return if the current node is empty</span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> }</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> </div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> inorder(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> BT::inorder_result.push_back(</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> root-&gt;data); <span class="comment">// Display the data part of the root (or current node)</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> inorder(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordflow">return</span> inorder_result;</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></div>
<div class="foldopen" id="foldopen00152" data-start="{" data-end="}">
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5"> 152</a></span>std::vector&lt;std::uint64_t&gt; <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">BT::preorder</a>(<a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *root) {</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) { <span class="comment">// if the current node is empty</span></div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">return</span> {};</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> BT::preorder_result.push_back(</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> root-&gt;data); <span class="comment">// Display the data part of the root (or current node)</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> </div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordflow">return</span> preorder_result;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span>}</div>
</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span></div>
<div class="foldopen" id="foldopen00172" data-start="{" data-end="}">
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c"> 172</a></span>std::vector&lt;std::uint64_t&gt; <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">BT::postorder</a>(<a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *root) {</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) { <span class="comment">// if the current node is empty</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> }</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> BT::postorder_result.push_back(</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> root-&gt;data); <span class="comment">// Display the data part of the root (or current node)</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="keywordflow">return</span> postorder_result;</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span>}</div>
</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> </div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span><span class="keywordtype">void</span> deleteAll(<span class="keyword">const</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<span class="keyword">const</span> root) {</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keywordflow">if</span> (root) {</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> deleteAll(root-&gt;left);</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> deleteAll(root-&gt;right);</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keyword">delete</span> root;</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> }</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span>}</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> </div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span>} <span class="comment">// namespace recursive_tree_traversals</span></div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> </div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span>} <span class="comment">// namespace others</span></div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span></div>
<div class="foldopen" id="foldopen00201" data-start="{" data-end="}">
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0"> 201</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj1;</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(7);</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(6);</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(9);</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(11);</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(4);</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> </div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> std::vector&lt;std::uint64_t&gt; actual_result_inorder{2, 7, 5, 6, 11,</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> 2, 5, 4, 9};</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> std::vector&lt;std::uint64_t&gt; actual_result_preorder{2, 7, 2, 6, 5,</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> 11, 5, 9, 4};</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> std::vector&lt;std::uint64_t&gt; actual_result_postorder{2, 5, 11, 6, 7,</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> 4, 9, 5, 2};</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> result_inorder; </div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> result_preorder; </div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> result_postorder; </div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> std::uint64_t size = actual_result_inorder.size();</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> </div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> result_inorder = obj1.inorder(root);</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Inorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> }</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> </div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> result_preorder = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Preorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> }</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> </div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> result_postorder = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Postorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> </div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> deleteAll(root);</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span>}</div>
</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span></div>
<div class="foldopen" id="foldopen00266" data-start="{" data-end="}">
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0"> 266</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj2;</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(1);</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(3);</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(4);</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(6);</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(7);</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(8);</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> </div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> std::vector&lt;std::uint64_t&gt; actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> std::vector&lt;std::uint64_t&gt; actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> std::vector&lt;std::uint64_t&gt; actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> result_inorder; </div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> result_preorder; </div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> result_postorder; </div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> </div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> std::uint64_t size = actual_result_inorder.size();</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> </div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> result_inorder = obj2.inorder(root);</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Inorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> }</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> </div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> result_preorder = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Preorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> }</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> </div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> result_postorder = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Postorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> }</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> </div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> deleteAll(root);</div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span>}</div>
</div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span></div>
<div class="foldopen" id="foldopen00327" data-start="{" data-end="}">
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e"> 327</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>() {</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj3;</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(1);</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(3);</div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(4);</div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> root-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a>-&gt;<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> </div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> std::vector&lt;std::uint64_t&gt; actual_result_inorder{4, 2, 5, 1, 3};</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> std::vector&lt;std::uint64_t&gt; actual_result_preorder{1, 2, 4, 5, 3};</div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> std::vector&lt;std::uint64_t&gt; actual_result_postorder{4, 5, 2, 3, 1};</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> result_inorder; </div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> result_preorder; </div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> std::vector&lt;std::uint64_t&gt;</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> result_postorder; </div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> </div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> std::uint64_t size = actual_result_inorder.size();</div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> </div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> result_inorder = obj3.inorder(root);</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Inorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> }</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> </div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> result_preorder = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Preorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> }</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> </div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> result_postorder = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Postorder Traversal...&quot;</span>;</div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> }</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> </div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> deleteAll(root);</div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span>}</div>
</div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span></div>
<div class="foldopen" id="foldopen00386" data-start="{" data-end="}">
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"> 386</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> std::cout &lt;&lt; <span class="stringliteral">&quot;1st test-case&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>(); <span class="comment">// run 1st test-case</span></div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test-case&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>(); <span class="comment">// run 2nd test-case</span></div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test-case&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>(); <span class="comment">// run 3rd test-case</span></div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span>}</div>
</div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span></div>
<div class="foldopen" id="foldopen00398" data-start="{" data-end="}">
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 398</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span>}</div>
</div>
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></div><div class="ttdoc">BT used to make the entire structure of the binary tree and the functions associated with the binary ...</div><div class="ttdef"><b>Definition</b> <a href="#l00088">recursive_tree_traversal.cpp:88</a></div></div>
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a6397b78ceec18cb1959a1d159e134da5"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">others::recursive_tree_traversals::BT::preorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; preorder(Node *)</div><div class="ttdoc">preorder function that will perform the preorder traversal recursively, and return the resultant vect...</div><div class="ttdef"><b>Definition</b> <a href="#l00152">recursive_tree_traversal.cpp:152</a></div></div>
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_ac9404b65f407f631915515fa2e08a40c"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">others::recursive_tree_traversals::BT::postorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; postorder(Node *)</div><div class="ttdoc">postorder function that will perform the postorder traversal recursively, and return the result vecto...</div><div class="ttdef"><b>Definition</b> <a href="#l00172">recursive_tree_traversal.cpp:172</a></div></div>
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_af16da5fe0f5c54d31778d71d5a042114"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">others::recursive_tree_traversals::BT::createNewNode</a></div><div class="ttdeci">Node * createNewNode(std::uint64_t)</div><div class="ttdoc">will allocate the memory for a node and, along the data and return the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00118">recursive_tree_traversal.cpp:118</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="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">2nd test-case</div><div class="ttdef"><b>Definition</b> <a href="#l00266">recursive_tree_traversal.cpp:266</a></div></div>
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">1st test-case</div><div class="ttdef"><b>Definition</b> <a href="#l00201">recursive_tree_traversal.cpp:201</a></div></div>
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00386">recursive_tree_traversal.cpp:386</a></div></div>
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">3rd test-case</div><div class="ttdef"><b>Definition</b> <a href="#l00327">recursive_tree_traversal.cpp:327</a></div></div>
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_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="#l00398">recursive_tree_traversal.cpp:398</a></div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
<div class="ttc" id="astructothers_1_1recursive__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></div><div class="ttdoc">The structure to hold Nodes of the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00079">recursive_tree_traversal.cpp:79</a></div></div>
<div class="ttc" id="astructothers_1_1recursive__tree__traversals_1_1_node_html_a59cc94ba784aeaefec2e915ddfdb1ade"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">others::recursive_tree_traversals::Node::data</a></div><div class="ttdeci">std::uint64_t data</div><div class="ttdoc">The value/key of the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00080">recursive_tree_traversal.cpp:80</a></div></div>
<div class="ttc" id="astructothers_1_1recursive__tree__traversals_1_1_node_html_a5a8a7bc2d2f847994220ae9e0b60fff3"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">others::recursive_tree_traversals::Node::left</a></div><div class="ttdeci">struct Node * left</div><div class="ttdoc">struct pointer to left subtree.</div><div class="ttdef"><b>Definition</b> <a href="#l00081">recursive_tree_traversal.cpp:81</a></div></div>
<div class="ttc" id="astructothers_1_1recursive__tree__traversals_1_1_node_html_ab875304781a4eb9661c0931a6f1fae83"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">others::recursive_tree_traversals::Node::right</a></div><div class="ttdeci">struct Node * right</div><div class="ttdoc">struct pointer to right subtree.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">recursive_tree_traversal.cpp:82</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp.html">recursive_tree_traversal.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.13.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink