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

Documentation for b6108e494d

Browse Source
This commit is contained in:
realstealthninja
2024-09-02 12:44:09 +00:00
parent 2ad14b2b2f
commit b81e962682
65 changed files with 602 additions and 479 deletions
Download Patch File Download Diff File Expand all files Collapse all files

158
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html
View File

@@ -117,40 +117,40 @@ $(function(){initNavTree('dd/de1/classothers_1_1recursive__tree__traversals_1_1_
<div class="dynheader">
Collaboration diagram for others::recursive_tree_traversals::BT:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg" width="180" height="259"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg" width="194" height="259"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a08711eb2d741f4b51d980cff03b53154" id="r_a08711eb2d741f4b51d980cff03b53154"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a08711eb2d741f4b51d980cff03b53154">createNewNode</a> (uint64_t)</td></tr>
<tr class="memdesc:a08711eb2d741f4b51d980cff03b53154"><td class="mdescLeft">&#160;</td><td class="mdescRight">will allocate the memory for a node and, along the data and return the node. <br /></td></tr>
<tr class="separator:a08711eb2d741f4b51d980cff03b53154"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a88ba36fcde4af23b7b8021b983b97294" id="r_a88ba36fcde4af23b7b8021b983b97294"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88ba36fcde4af23b7b8021b983b97294">inorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
<tr class="separator:a88ba36fcde4af23b7b8021b983b97294"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abce10afbf9e16ce4a788af6b58abbebb" id="r_abce10afbf9e16ce4a788af6b58abbebb"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abce10afbf9e16ce4a788af6b58abbebb">preorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
<tr class="memdesc:abce10afbf9e16ce4a788af6b58abbebb"><td class="mdescLeft">&#160;</td><td class="mdescRight">preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree. <br /></td></tr>
<tr class="separator:abce10afbf9e16ce4a788af6b58abbebb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5224e6c2ba322b17cc2c3287b77742d5" id="r_a5224e6c2ba322b17cc2c3287b77742d5"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5224e6c2ba322b17cc2c3287b77742d5">postorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
<tr class="memdesc:a5224e6c2ba322b17cc2c3287b77742d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree. <br /></td></tr>
<tr class="separator:a5224e6c2ba322b17cc2c3287b77742d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af16da5fe0f5c54d31778d71d5a042114" id="r_af16da5fe0f5c54d31778d71d5a042114"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>)</td></tr>
<tr class="memdesc:af16da5fe0f5c54d31778d71d5a042114"><td class="mdescLeft">&#160;</td><td class="mdescRight">will allocate the memory for a node and, along the data and return the node. <br /></td></tr>
<tr class="separator:af16da5fe0f5c54d31778d71d5a042114"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a142689a84eaafcd22b68fad887b14540" id="r_a142689a84eaafcd22b68fad887b14540"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a142689a84eaafcd22b68fad887b14540">inorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
<tr class="separator:a142689a84eaafcd22b68fad887b14540"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6397b78ceec18cb1959a1d159e134da5" id="r_a6397b78ceec18cb1959a1d159e134da5"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6397b78ceec18cb1959a1d159e134da5">preorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
<tr class="memdesc:a6397b78ceec18cb1959a1d159e134da5"><td class="mdescLeft">&#160;</td><td class="mdescRight">preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree. <br /></td></tr>
<tr class="separator:a6397b78ceec18cb1959a1d159e134da5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac9404b65f407f631915515fa2e08a40c" id="r_ac9404b65f407f631915515fa2e08a40c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac9404b65f407f631915515fa2e08a40c">postorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
<tr class="memdesc:ac9404b65f407f631915515fa2e08a40c"><td class="mdescLeft">&#160;</td><td class="mdescRight">postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree. <br /></td></tr>
<tr class="separator:ac9404b65f407f631915515fa2e08a40c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a4c9a0d34e4a692a0dff86385b8530b50" id="r_a4c9a0d34e4a692a0dff86385b8530b50"><td class="memItemLeft" align="right" valign="top"><a id="a4c9a0d34e4a692a0dff86385b8530b50" name="a4c9a0d34e4a692a0dff86385b8530b50"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>inorder_result</b></td></tr>
<tr class="separator:a4c9a0d34e4a692a0dff86385b8530b50"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2f98ffe98b2191518faf3692b6aa5355" id="r_a2f98ffe98b2191518faf3692b6aa5355"><td class="memItemLeft" align="right" valign="top"><a id="a2f98ffe98b2191518faf3692b6aa5355" name="a2f98ffe98b2191518faf3692b6aa5355"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>preorder_result</b></td></tr>
<tr class="separator:a2f98ffe98b2191518faf3692b6aa5355"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2161a6a2339ed51b14e4619abb9a3df8" id="r_a2161a6a2339ed51b14e4619abb9a3df8"><td class="memItemLeft" align="right" valign="top"><a id="a2161a6a2339ed51b14e4619abb9a3df8" name="a2161a6a2339ed51b14e4619abb9a3df8"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>postorder_result</b></td></tr>
<tr class="separator:a2161a6a2339ed51b14e4619abb9a3df8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a56cf8c75b7d9775841afb54f34df7548" id="r_a56cf8c75b7d9775841afb54f34df7548"><td class="memItemLeft" align="right" valign="top"><a id="a56cf8c75b7d9775841afb54f34df7548" name="a56cf8c75b7d9775841afb54f34df7548"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>inorder_result</b></td></tr>
<tr class="separator:a56cf8c75b7d9775841afb54f34df7548"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad3aa0b0a663f1cf17ac98345d2cd7072" id="r_ad3aa0b0a663f1cf17ac98345d2cd7072"><td class="memItemLeft" align="right" valign="top"><a id="ad3aa0b0a663f1cf17ac98345d2cd7072" name="ad3aa0b0a663f1cf17ac98345d2cd7072"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>preorder_result</b></td></tr>
<tr class="separator:ad3aa0b0a663f1cf17ac98345d2cd7072"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a25989ceb1bd110da23805a5d99527ecb" id="r_a25989ceb1bd110da23805a5d99527ecb"><td class="memItemLeft" align="right" valign="top"><a id="a25989ceb1bd110da23805a5d99527ecb" name="a25989ceb1bd110da23805a5d99527ecb"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>postorder_result</b></td></tr>
<tr class="separator:a25989ceb1bd110da23805a5d99527ecb"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ...">BT</a> used to make the entire structure of the binary tree and the functions associated with the binary tree. </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a id="a08711eb2d741f4b51d980cff03b53154" name="a08711eb2d741f4b51d980cff03b53154"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a08711eb2d741f4b51d980cff03b53154">&#9670;&#160;</a></span>createNewNode()</h2>
<a id="af16da5fe0f5c54d31778d71d5a042114" name="af16da5fe0f5c54d31778d71d5a042114"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af16da5fe0f5c54d31778d71d5a042114">&#9670;&#160;</a></span>createNewNode()</h2>
<div class="memitem">
<div class="memproto">
@@ -158,7 +158,7 @@ Public Attributes</h2></td></tr>
<tr>
<td class="memname"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> * others::recursive_tree_traversals::BT::createNewNode </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a></td> <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -172,12 +172,12 @@ Public Attributes</h2></td></tr>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>pointer to the newly created node with assigned data. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 116</span> {</div>
<div class="line"><span class="lineno"> 117</span> <a class="code hl_class" href="../../db/d8b/struct_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_class" href="../../db/d8b/struct_node.html">Node</a>();</div>
<div class="line"><span class="lineno"> 118</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"><span class="lineno"> 119</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"><span class="lineno"> 120</span> <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 121</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 118</span> {</div>
<div class="line"><span class="lineno"> 119</span> <a class="code hl_class" href="../../db/d8b/struct_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_class" href="../../db/d8b/struct_node.html">Node</a>();</div>
<div class="line"><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"><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"><span class="lineno"> 122</span> <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 123</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</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> hash_search.cpp:24</div></div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
@@ -185,43 +185,43 @@ Public Attributes</h2></td></tr>
</div><!-- fragment -->
</div>
</div>
<a id="a88ba36fcde4af23b7b8021b983b97294" name="a88ba36fcde4af23b7b8021b983b97294"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a88ba36fcde4af23b7b8021b983b97294">&#9670;&#160;</a></span>inorder()</h2>
<a id="a142689a84eaafcd22b68fad887b14540" name="a142689a84eaafcd22b68fad887b14540"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a142689a84eaafcd22b68fad887b14540">&#9670;&#160;</a></span>inorder()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; others::recursive_tree_traversals::BT::inorder </td>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt; others::recursive_tree_traversals::BT::inorder </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 130</span> {</div>
<div class="line"><span class="lineno"> 131</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"><span class="lineno"> 132</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><span class="lineno"> 133</span> }</div>
<div class="line"><span class="lineno"> 134</span> </div>
<div class="line"><span class="lineno"> 135</span> inorder(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><span class="lineno"> 136</span> BT::inorder_result.push_back(</div>
<div class="line"><span class="lineno"> 137</span> root-&gt;data); <span class="comment">// Display the data part of the root (or current node)</span></div>
<div class="line"><span class="lineno"> 138</span> inorder(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><span class="lineno"> 139</span> </div>
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">return</span> inorder_result;</div>
<div class="line"><span class="lineno"> 141</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 132</span> {</div>
<div class="line"><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"><span class="lineno"> 134</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><span class="lineno"> 135</span> }</div>
<div class="line"><span class="lineno"> 136</span> </div>
<div class="line"><span class="lineno"> 137</span> inorder(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><span class="lineno"> 138</span> BT::inorder_result.push_back(</div>
<div class="line"><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"><span class="lineno"> 140</span> inorder(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><span class="lineno"> 141</span> </div>
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">return</span> inorder_result;</div>
<div class="line"><span class="lineno"> 143</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a5224e6c2ba322b17cc2c3287b77742d5" name="a5224e6c2ba322b17cc2c3287b77742d5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5224e6c2ba322b17cc2c3287b77742d5">&#9670;&#160;</a></span>postorder()</h2>
<a id="ac9404b65f407f631915515fa2e08a40c" name="ac9404b65f407f631915515fa2e08a40c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac9404b65f407f631915515fa2e08a40c">&#9670;&#160;</a></span>postorder()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; others::recursive_tree_traversals::BT::postorder </td>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt; others::recursive_tree_traversals::BT::postorder </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
@@ -237,35 +237,35 @@ Public Attributes</h2></td></tr>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>result that is containing the postorder traversal of a tree </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 170</span> {</div>
<div class="line"><span class="lineno"> 171</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"><span class="lineno"> 172</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><span class="lineno"> 173</span> }</div>
<div class="line"><span class="lineno"> 174</span> </div>
<div class="line"><span class="lineno"> 175</span> <a class="code hl_function" href="#a5224e6c2ba322b17cc2c3287b77742d5">postorder</a>(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_function" href="#a5224e6c2ba322b17cc2c3287b77742d5">postorder</a>(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><span class="lineno"> 177</span> BT::postorder_result.push_back(</div>
<div class="line"><span class="lineno"> 178</span> root-&gt;data); <span class="comment">// Display the data part of the root (or current node)</span></div>
<div class="line"><span class="lineno"> 179</span> </div>
<div class="line"><span class="lineno"> 180</span> <span class="keywordflow">return</span> postorder_result;</div>
<div class="line"><span class="lineno"> 181</span>}</div>
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a5224e6c2ba322b17cc2c3287b77742d5"><div class="ttname"><a href="#a5224e6c2ba322b17cc2c3287b77742d5">others::recursive_tree_traversals::BT::postorder</a></div><div class="ttdeci">std::vector&lt; 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> recursive_tree_traversal.cpp:170</div></div>
<div class="fragment"><div class="line"><span class="lineno"> 172</span> {</div>
<div class="line"><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"><span class="lineno"> 174</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><span class="lineno"> 175</span> }</div>
<div class="line"><span class="lineno"> 176</span> </div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_function" href="#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><span class="lineno"> 178</span> <a class="code hl_function" href="#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><span class="lineno"> 179</span> BT::postorder_result.push_back(</div>
<div class="line"><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"><span class="lineno"> 181</span> </div>
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">return</span> postorder_result;</div>
<div class="line"><span class="lineno"> 183</span>}</div>
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_ac9404b65f407f631915515fa2e08a40c"><div class="ttname"><a href="#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> recursive_tree_traversal.cpp:172</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.svg" width="182" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg" width="182" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="abce10afbf9e16ce4a788af6b58abbebb" name="abce10afbf9e16ce4a788af6b58abbebb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abce10afbf9e16ce4a788af6b58abbebb">&#9670;&#160;</a></span>preorder()</h2>
<a id="a6397b78ceec18cb1959a1d159e134da5" name="a6397b78ceec18cb1959a1d159e134da5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6397b78ceec18cb1959a1d159e134da5">&#9670;&#160;</a></span>preorder()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; others::recursive_tree_traversals::BT::preorder </td>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt; others::recursive_tree_traversals::BT::preorder </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
@@ -281,23 +281,23 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>result that is containing the preorder traversal of a tree </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 150</span> {</div>
<div class="line"><span class="lineno"> 151</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"><span class="lineno"> 152</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><span class="lineno"> 153</span> }</div>
<div class="line"><span class="lineno"> 154</span> </div>
<div class="line"><span class="lineno"> 155</span> BT::preorder_result.push_back(</div>
<div class="line"><span class="lineno"> 156</span> root-&gt;data); <span class="comment">// Display the data part of the root (or current node)</span></div>
<div class="line"><span class="lineno"> 157</span> <a class="code hl_function" href="#abce10afbf9e16ce4a788af6b58abbebb">preorder</a>(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><span class="lineno"> 158</span> <a class="code hl_function" href="#abce10afbf9e16ce4a788af6b58abbebb">preorder</a>(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><span class="lineno"> 159</span> </div>
<div class="line"><span class="lineno"> 160</span> <span class="keywordflow">return</span> preorder_result;</div>
<div class="line"><span class="lineno"> 161</span>}</div>
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_abce10afbf9e16ce4a788af6b58abbebb"><div class="ttname"><a href="#abce10afbf9e16ce4a788af6b58abbebb">others::recursive_tree_traversals::BT::preorder</a></div><div class="ttdeci">std::vector&lt; 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> recursive_tree_traversal.cpp:150</div></div>
<div class="fragment"><div class="line"><span class="lineno"> 152</span> {</div>
<div class="line"><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"><span class="lineno"> 154</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><span class="lineno"> 155</span> }</div>
<div class="line"><span class="lineno"> 156</span> </div>
<div class="line"><span class="lineno"> 157</span> BT::preorder_result.push_back(</div>
<div class="line"><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"><span class="lineno"> 159</span> <a class="code hl_function" href="#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root-&gt;left); <span class="comment">// Traverse the left subtree</span></div>
<div class="line"><span class="lineno"> 160</span> <a class="code hl_function" href="#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root-&gt;right); <span class="comment">// Traverse the right subtree</span></div>
<div class="line"><span class="lineno"> 161</span> </div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">return</span> preorder_result;</div>
<div class="line"><span class="lineno"> 163</span>}</div>
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a6397b78ceec18cb1959a1d159e134da5"><div class="ttname"><a href="#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> recursive_tree_traversal.cpp:152</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.svg" width="376" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg" width="376" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>

6
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.js
View File

@@ -1,6 +1,6 @@
var classothers_1_1recursive__tree__traversals_1_1_b_t =
[
[ "createNewNode", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154", null ],
[ "postorder", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5", null ],
[ "preorder", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb", null ]
[ "createNewNode", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114", null ],
[ "postorder", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c", null ],
[ "preorder", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5", null ]
];

0
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.map → dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.map
View File

0
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.md5 → dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.md5
View File

0
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.svg → dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

0
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph_org.svg → dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph_org.svg
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

0
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.map → dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.map
View File

0
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.md5 → dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.md5
View File

0
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.svg → dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

0
dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph_org.svg → dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph_org.svg
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 1.6 KiB