mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-04 08:22:19 +08:00
Documentation for b6108e494d
This commit is contained in:
realstealthninja
@@ -110,12 +110,12 @@ $(function(){initNavTree('dd/de1/classothers_1_1recursive__tree__traversals_1_1_
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(uint64_t)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(std::uint64_t)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>inorder</b>(Node *) (defined in <a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a>)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>inorder_result</b> (defined in <a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a>)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5">postorder</a>(Node *)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(Node *)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>postorder_result</b> (defined in <a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a>)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb">preorder</a>(Node *)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(Node *)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>preorder_result</b> (defined in <a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a>)</td><td class="entry"><a class="el" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></td><td class="entry"></td></tr>
|
||||
</table></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
|
||||
@@ -115,12 +115,13 @@ $(function(){initNavTree('dc/de1/recursive__tree__traversal_8cpp.html','../../')
|
||||
<p>Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>)
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <cstdint></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for recursive_tree_traversal.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/dae/recursive__tree__traversal_8cpp__incl.svg" width="252" height="126"><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/dae/recursive__tree__traversal_8cpp__incl.svg" width="336" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
|
||||
@@ -143,6 +144,8 @@ Namespaces</h2></td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a951f01040f518d611228c1d182b8242c" id="r_a951f01040f518d611228c1d182b8242c"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a951f01040f518d611228c1d182b8242c">others::recursive_tree_traversals::deleteAll</a> (const <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *const root)</td></tr>
|
||||
<tr class="separator:a951f01040f518d611228c1d182b8242c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
|
||||
<tr class="memdesc:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="mdescLeft"> </td><td class="mdescRight">1st test-case <br /></td></tr>
|
||||
<tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
@@ -178,6 +181,30 @@ Iterative Postorder Traversal of a tree</h3>
|
||||
<p>In normal postorder traversal, visit the left subtree before the right subtree. If we visit the right subtree before visiting the left subtree, it is referred to as reverse postorder traversal.</p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Lazeeez" target="_blank">Lajat Manekar</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="a951f01040f518d611228c1d182b8242c" name="a951f01040f518d611228c1d182b8242c"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a951f01040f518d611228c1d182b8242c">◆ </a></span>deleteAll()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void others::recursive_tree_traversals::deleteAll </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *const</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"> 185</span> {</div>
|
||||
<div class="line"><span class="lineno"> 186</span> <span class="keywordflow">if</span> (root) {</div>
|
||||
<div class="line"><span class="lineno"> 187</span> deleteAll(root->left);</div>
|
||||
<div class="line"><span class="lineno"> 188</span> deleteAll(root->right);</div>
|
||||
<div class="line"><span class="lineno"> 189</span> <span class="keyword">delete</span> root;</div>
|
||||
<div class="line"><span class="lineno"> 190</span> }</div>
|
||||
<div class="line"><span class="lineno"> 191</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
@@ -195,11 +222,11 @@ Iterative Postorder Traversal of a tree</h3>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 373</span> {</div>
|
||||
<div class="line"><span class="lineno"> 374</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 375</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 376</span>}</div>
|
||||
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:361</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 398</span> {</div>
|
||||
<div class="line"><span class="lineno"> 399</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 400</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 401</span>}</div>
|
||||
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:386</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -228,66 +255,74 @@ Here is the call graph for this function:</div>
|
||||
<p>< result stores the inorder traversal of the binary tree</p>
|
||||
<p>< result stores the preorder traversal of the binary tree</p>
|
||||
<p>< result stores the postorder traversal of the binary tree</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 191</span> {</div>
|
||||
<div class="line"><span class="lineno"> 192</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"><span class="lineno"> 193</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#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(2);</div>
|
||||
<div class="line"><span class="lineno"> 194</span> root->left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(7);</div>
|
||||
<div class="line"><span class="lineno"> 195</span> root->right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(5);</div>
|
||||
<div class="line"><span class="lineno"> 196</span> root->left->left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(2);</div>
|
||||
<div class="line"><span class="lineno"> 197</span> root->left->right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(6);</div>
|
||||
<div class="line"><span class="lineno"> 198</span> root->right->right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(9);</div>
|
||||
<div class="line"><span class="lineno"> 199</span> root->left->right->left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(5);</div>
|
||||
<div class="line"><span class="lineno"> 200</span> root->left->right->right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(11);</div>
|
||||
<div class="line"><span class="lineno"> 201</span> root->right->right->left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(4);</div>
|
||||
<div class="line"><span class="lineno"> 202</span> </div>
|
||||
<div class="line"><span class="lineno"> 203</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_inorder{2, 7, 5, 6, 11, 2, 5, 4, 9};</div>
|
||||
<div class="line"><span class="lineno"> 204</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_preorder{2, 7, 2, 6, 5, 11, 5, 9, 4};</div>
|
||||
<div class="line"><span class="lineno"> 205</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_postorder{2, 5, 11, 6, 7, 4, 9, 5, 2};</div>
|
||||
<div class="line"><span class="lineno"> 206</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_inorder; <span class="comment">///< result stores the inorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 207</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 208</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_preorder; <span class="comment">///< result stores the preorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 209</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 210</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_postorder; <span class="comment">///< result stores the postorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 211</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 212</span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 213</span> uint64_t size = actual_result_inorder.size();</div>
|
||||
<div class="line"><span class="lineno"> 214</span> </div>
|
||||
<div class="line"><span class="lineno"> 215</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 216</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 217</span> result_inorder = obj1.inorder(root);</div>
|
||||
<div class="line"><span class="lineno"> 218</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #1: Inorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 219</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 220</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 221</span> }</div>
|
||||
<div class="line"><span class="lineno"> 222</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 223</span> </div>
|
||||
<div class="line"><span class="lineno"> 224</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 225</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 226</span> result_preorder = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb">preorder</a>(root);</div>
|
||||
<div class="line"><span class="lineno"> 227</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #1: Preorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 228</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 229</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 230</span> }</div>
|
||||
<div class="line"><span class="lineno"> 231</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 232</span> </div>
|
||||
<div class="line"><span class="lineno"> 233</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 234</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 235</span> result_postorder = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5">postorder</a>(root);</div>
|
||||
<div class="line"><span class="lineno"> 236</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #1: Postorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 237</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 238</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 239</span> }</div>
|
||||
<div class="line"><span class="lineno"> 240</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 241</span> </div>
|
||||
<div class="line"><span class="lineno"> 242</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 243</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 201</span> {</div>
|
||||
<div class="line"><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"><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"><span class="lineno"> 204</span> root->left = 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"><span class="lineno"> 205</span> root->right = 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"><span class="lineno"> 206</span> root->left->left = 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"><span class="lineno"> 207</span> root->left->right = 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"><span class="lineno"> 208</span> root->right->right = 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"><span class="lineno"> 209</span> root->left->right->left = 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"><span class="lineno"> 210</span> root->left->right->right = 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"><span class="lineno"> 211</span> root->right->right->left = 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"><span class="lineno"> 212</span> </div>
|
||||
<div class="line"><span class="lineno"> 213</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_inorder{2, 7, 5, 6, 11,</div>
|
||||
<div class="line"><span class="lineno"> 214</span> 2, 5, 4, 9};</div>
|
||||
<div class="line"><span class="lineno"> 215</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_preorder{2, 7, 2, 6, 5,</div>
|
||||
<div class="line"><span class="lineno"> 216</span> 11, 5, 9, 4};</div>
|
||||
<div class="line"><span class="lineno"> 217</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_postorder{2, 5, 11, 6, 7,</div>
|
||||
<div class="line"><span class="lineno"> 218</span> 4, 9, 5, 2};</div>
|
||||
<div class="line"><span class="lineno"> 219</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 220</span> result_inorder; <span class="comment">///< result stores the inorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 221</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 222</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 223</span> result_preorder; <span class="comment">///< result stores the preorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 224</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 225</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 226</span> result_postorder; <span class="comment">///< result stores the postorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 227</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 228</span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 229</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> size = actual_result_inorder.size();</div>
|
||||
<div class="line"><span class="lineno"> 230</span> </div>
|
||||
<div class="line"><span class="lineno"> 231</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 232</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 233</span> result_inorder = obj1.inorder(root);</div>
|
||||
<div class="line"><span class="lineno"> 234</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #1: Inorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 235</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 236</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 237</span> }</div>
|
||||
<div class="line"><span class="lineno"> 238</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 239</span> </div>
|
||||
<div class="line"><span class="lineno"> 240</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 241</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 243</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #1: Preorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 244</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 245</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 246</span> }</div>
|
||||
<div class="line"><span class="lineno"> 247</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 248</span> </div>
|
||||
<div class="line"><span class="lineno"> 249</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 250</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 252</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #1: Postorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 253</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 254</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 255</span> }</div>
|
||||
<div class="line"><span class="lineno"> 256</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 257</span> </div>
|
||||
<div class="line"><span class="lineno"> 258</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 259</span> deleteAll(root);</div>
|
||||
<div class="line"><span class="lineno"> 260</span>}</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></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> recursive_tree_traversal.cpp:87</div></div>
|
||||
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a08711eb2d741f4b51d980cff03b53154"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">others::recursive_tree_traversals::BT::createNewNode</a></div><div class="ttdeci">Node * createNewNode(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> recursive_tree_traversal.cpp:116</div></div>
|
||||
<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a5224e6c2ba322b17cc2c3287b77742d5"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5">others::recursive_tree_traversals::BT::postorder</a></div><div class="ttdeci">std::vector< uint64_t > 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="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_abce10afbf9e16ce4a788af6b58abbebb"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb">others::recursive_tree_traversals::BT::preorder</a></div><div class="ttdeci">std::vector< uint64_t > 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="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> recursive_tree_traversal.cpp:88</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< std::uint64_t > 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 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< std::uint64_t > 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 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> recursive_tree_traversal.cpp:118</div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</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> recursive_tree_traversal.cpp:78</div></div>
|
||||
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</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> recursive_tree_traversal.cpp:79</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -317,58 +352,62 @@ Here is the call graph for this function:</div>
|
||||
<p>< result stores the inorder traversal of the binary tree</p>
|
||||
<p>< result stores the preorder traversal of the binary tree</p>
|
||||
<p>< result stores the postorder traversal of the binary tree</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 249</span> {</div>
|
||||
<div class="line"><span class="lineno"> 250</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"><span class="lineno"> 251</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#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(1);</div>
|
||||
<div class="line"><span class="lineno"> 252</span> root->left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(2);</div>
|
||||
<div class="line"><span class="lineno"> 253</span> root->right = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(3);</div>
|
||||
<div class="line"><span class="lineno"> 254</span> root->left->left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(4);</div>
|
||||
<div class="line"><span class="lineno"> 255</span> root->right->left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(5);</div>
|
||||
<div class="line"><span class="lineno"> 256</span> root->right->right = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(6);</div>
|
||||
<div class="line"><span class="lineno"> 257</span> root->right->left->left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(7);</div>
|
||||
<div class="line"><span class="lineno"> 258</span> root->right->left->right = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(8);</div>
|
||||
<div class="line"><span class="lineno"> 259</span> </div>
|
||||
<div class="line"><span class="lineno"> 260</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};</div>
|
||||
<div class="line"><span class="lineno"> 261</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};</div>
|
||||
<div class="line"><span class="lineno"> 262</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};</div>
|
||||
<div class="line"><span class="lineno"> 263</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_inorder; <span class="comment">///< result stores the inorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 264</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 265</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_preorder; <span class="comment">///< result stores the preorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 266</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 267</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_postorder; <span class="comment">///< result stores the postorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 268</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 269</span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 270</span> uint64_t size = actual_result_inorder.size();</div>
|
||||
<div class="line"><span class="lineno"> 271</span> </div>
|
||||
<div class="line"><span class="lineno"> 272</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 273</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 274</span> result_inorder = obj2.inorder(root);</div>
|
||||
<div class="line"><span class="lineno"> 275</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #2: Inorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 276</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 277</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 278</span> }</div>
|
||||
<div class="line"><span class="lineno"> 279</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 280</span> </div>
|
||||
<div class="line"><span class="lineno"> 281</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 282</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 283</span> result_preorder = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb">preorder</a>(root);</div>
|
||||
<div class="line"><span class="lineno"> 284</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #2: Preorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 285</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 286</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 287</span> }</div>
|
||||
<div class="line"><span class="lineno"> 288</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 289</span> </div>
|
||||
<div class="line"><span class="lineno"> 290</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 291</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 292</span> result_postorder = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5">postorder</a>(root);</div>
|
||||
<div class="line"><span class="lineno"> 293</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #2: Postorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 294</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 295</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 296</span> }</div>
|
||||
<div class="line"><span class="lineno"> 297</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 298</span> </div>
|
||||
<div class="line"><span class="lineno"> 299</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 300</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 266</span> {</div>
|
||||
<div class="line"><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"><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"><span class="lineno"> 269</span> root->left = 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"><span class="lineno"> 270</span> root->right = 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"><span class="lineno"> 271</span> root->left->left = 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"><span class="lineno"> 272</span> root->right->left = 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"><span class="lineno"> 273</span> root->right->right = 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"><span class="lineno"> 274</span> root->right->left->left = 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"><span class="lineno"> 275</span> root->right->left->right = 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"><span class="lineno"> 276</span> </div>
|
||||
<div class="line"><span class="lineno"> 277</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};</div>
|
||||
<div class="line"><span class="lineno"> 278</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};</div>
|
||||
<div class="line"><span class="lineno"> 279</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};</div>
|
||||
<div class="line"><span class="lineno"> 280</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 281</span> result_inorder; <span class="comment">///< result stores the inorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 282</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 283</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 284</span> result_preorder; <span class="comment">///< result stores the preorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 285</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 286</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 287</span> result_postorder; <span class="comment">///< result stores the postorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 288</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 289</span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 290</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> size = actual_result_inorder.size();</div>
|
||||
<div class="line"><span class="lineno"> 291</span> </div>
|
||||
<div class="line"><span class="lineno"> 292</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 293</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 294</span> result_inorder = obj2.inorder(root);</div>
|
||||
<div class="line"><span class="lineno"> 295</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #2: Inorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 296</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 297</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 298</span> }</div>
|
||||
<div class="line"><span class="lineno"> 299</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 300</span> </div>
|
||||
<div class="line"><span class="lineno"> 301</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 302</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 304</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #2: Preorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 305</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 306</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 307</span> }</div>
|
||||
<div class="line"><span class="lineno"> 308</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 309</span> </div>
|
||||
<div class="line"><span class="lineno"> 310</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 311</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 313</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #2: Postorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 314</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 315</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 316</span> }</div>
|
||||
<div class="line"><span class="lineno"> 317</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 318</span> </div>
|
||||
<div class="line"><span class="lineno"> 319</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 320</span> deleteAll(root);</div>
|
||||
<div class="line"><span class="lineno"> 321</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -397,56 +436,60 @@ Here is the call graph for this function:</div>
|
||||
<p>< result stores the inorder traversal of the binary tree</p>
|
||||
<p>< result stores the preorder traversal of the binary tree</p>
|
||||
<p>< result stores the postorder traversal of the binary tree</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 306</span> {</div>
|
||||
<div class="line"><span class="lineno"> 307</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"><span class="lineno"> 308</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#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(1);</div>
|
||||
<div class="line"><span class="lineno"> 309</span> root->left = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(2);</div>
|
||||
<div class="line"><span class="lineno"> 310</span> root->right = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(3);</div>
|
||||
<div class="line"><span class="lineno"> 311</span> root->left->left = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(4);</div>
|
||||
<div class="line"><span class="lineno"> 312</span> root->left->right = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154">createNewNode</a>(5);</div>
|
||||
<div class="line"><span class="lineno"> 313</span> </div>
|
||||
<div class="line"><span class="lineno"> 314</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_inorder{4, 2, 5, 1, 3};</div>
|
||||
<div class="line"><span class="lineno"> 315</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_preorder{1, 2, 4, 5, 3};</div>
|
||||
<div class="line"><span class="lineno"> 316</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> actual_result_postorder{4, 5, 2, 3, 1};</div>
|
||||
<div class="line"><span class="lineno"> 317</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_inorder; <span class="comment">///< result stores the inorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 318</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 319</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_preorder; <span class="comment">///< result stores the preorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 320</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 321</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> result_postorder; <span class="comment">///< result stores the postorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 322</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 323</span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 324</span> uint64_t size = actual_result_inorder.size();</div>
|
||||
<div class="line"><span class="lineno"> 325</span> </div>
|
||||
<div class="line"><span class="lineno"> 326</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 327</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 328</span> </div>
|
||||
<div class="line"><span class="lineno"> 329</span> result_inorder = obj3.inorder(root);</div>
|
||||
<div class="line"><span class="lineno"> 330</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #3: Inorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 331</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 332</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 333</span> }</div>
|
||||
<div class="line"><span class="lineno"> 334</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 335</span> </div>
|
||||
<div class="line"><span class="lineno"> 336</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 337</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 338</span> result_preorder = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb">preorder</a>(root);</div>
|
||||
<div class="line"><span class="lineno"> 339</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #3: Preorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 340</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 341</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 342</span> }</div>
|
||||
<div class="line"><span class="lineno"> 343</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 344</span> </div>
|
||||
<div class="line"><span class="lineno"> 345</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 346</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 347</span> result_postorder = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5">postorder</a>(root);</div>
|
||||
<div class="line"><span class="lineno"> 348</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #3: Postorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 349</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 350</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 351</span> }</div>
|
||||
<div class="line"><span class="lineno"> 352</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 353</span> </div>
|
||||
<div class="line"><span class="lineno"> 354</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 355</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 327</span> {</div>
|
||||
<div class="line"><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"><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"><span class="lineno"> 330</span> root->left = 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"><span class="lineno"> 331</span> root->right = 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"><span class="lineno"> 332</span> root->left->left = 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"><span class="lineno"> 333</span> root->left->right = 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"><span class="lineno"> 334</span> </div>
|
||||
<div class="line"><span class="lineno"> 335</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_inorder{4, 2, 5, 1, 3};</div>
|
||||
<div class="line"><span class="lineno"> 336</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_preorder{1, 2, 4, 5, 3};</div>
|
||||
<div class="line"><span class="lineno"> 337</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a> actual_result_postorder{4, 5, 2, 3, 1};</div>
|
||||
<div class="line"><span class="lineno"> 338</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 339</span> result_inorder; <span class="comment">///< result stores the inorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 340</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 341</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 342</span> result_preorder; <span class="comment">///< result stores the preorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 343</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 344</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::uint64_t></a></div>
|
||||
<div class="line"><span class="lineno"> 345</span> result_postorder; <span class="comment">///< result stores the postorder</span><span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 346</span><span class="comment"> ///< traversal of the binary tree</span></div>
|
||||
<div class="line"><span class="lineno"> 347</span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 348</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> size = actual_result_inorder.size();</div>
|
||||
<div class="line"><span class="lineno"> 349</span> </div>
|
||||
<div class="line"><span class="lineno"> 350</span> <span class="comment">// Calling inorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 351</span> <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 352</span> </div>
|
||||
<div class="line"><span class="lineno"> 353</span> result_inorder = obj3.inorder(root);</div>
|
||||
<div class="line"><span class="lineno"> 354</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #3: Inorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 355</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 356</span> assert(actual_result_inorder[i] == result_inorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 357</span> }</div>
|
||||
<div class="line"><span class="lineno"> 358</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 359</span> </div>
|
||||
<div class="line"><span class="lineno"> 360</span> <span class="comment">// Calling preorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 361</span> <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 363</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #3: Preorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 364</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 365</span> assert(actual_result_preorder[i] == result_preorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 366</span> }</div>
|
||||
<div class="line"><span class="lineno"> 367</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 368</span> </div>
|
||||
<div class="line"><span class="lineno"> 369</span> <span class="comment">// Calling postorder() function by passing a root node,</span></div>
|
||||
<div class="line"><span class="lineno"> 370</span> <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 372</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Testcase #3: Postorder Traversal..."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 373</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 374</span> assert(actual_result_postorder[i] == result_postorder[i]);</div>
|
||||
<div class="line"><span class="lineno"> 375</span> }</div>
|
||||
<div class="line"><span class="lineno"> 376</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 377</span> </div>
|
||||
<div class="line"><span class="lineno"> 378</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 379</span> deleteAll(root);</div>
|
||||
<div class="line"><span class="lineno"> 380</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -480,17 +523,17 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 361</span> {</div>
|
||||
<div class="line"><span class="lineno"> 362</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test-case"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 363</span> <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>(); <span class="comment">// run 1st test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 364</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test-case"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 365</span> <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>(); <span class="comment">// run 2nd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 366</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test-case"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 367</span> <a class="code hl_function" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a>(); <span class="comment">// run 3rd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 368</span>}</div>
|
||||
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">2nd test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:249</div></div>
|
||||
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">1st test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:191</div></div>
|
||||
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">3rd test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:306</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 386</span> {</div>
|
||||
<div class="line"><span class="lineno"> 387</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test-case"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 388</span> <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>(); <span class="comment">// run 1st test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 389</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test-case"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 390</span> <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>(); <span class="comment">// run 2nd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 391</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test-case"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 392</span> <a class="code hl_function" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a>(); <span class="comment">// run 3rd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 393</span>}</div>
|
||||
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">2nd test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:266</div></div>
|
||||
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">1st test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:201</div></div>
|
||||
<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">3rd test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:327</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
|
||||
@@ -1,12 +1,12 @@
|
||||
<map id="test2" name="test2">
|
||||
<area shape="rect" id="Node000001" title="2nd test-case" alt="" coords="5,112,56,137"/>
|
||||
<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
|
||||
<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,109,67,82,102,55,111,50,114,55,105,60,71,86,45,113"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="173,70,244,96"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,116,158,92,159,97,57,121"/>
|
||||
<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
|
||||
<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,127,109,139,108,144,56,132"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="45,136,71,164,105,194,151,223,149,228,102,198,68,168,41,139"/>
|
||||
<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="175,144,173,134,179,125,191,119,209,117,228,120,240,126,237,131,227,125,209,123,192,125,182,129,178,135,180,143"/>
|
||||
<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="175,233,173,223,179,214,191,209,209,207,228,209,240,215,237,220,227,214,209,212,192,214,182,218,178,224,180,232"/>
|
||||
|
||||
@@ -1 +1 @@
|
||||
0b5bc193bdb810aa8fe0cfa6d7b9334e
|
||||
c7072df08cb5f99034991db3e499a77f
|
||||
@@ -31,7 +31,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
|
||||
<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -68,7 +68,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
|
||||
<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -87,7 +87,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
|
||||
<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 7.5 KiB After Width: | Height: | Size: 7.5 KiB |
@@ -20,7 +20,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
|
||||
<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -57,7 +57,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
|
||||
<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -76,7 +76,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
|
||||
<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 6.7 KiB After Width: | Height: | Size: 6.7 KiB |
@@ -1,12 +1,12 @@
|
||||
<map id="test1" name="test1">
|
||||
<area shape="rect" id="Node000001" title="1st test-case" alt="" coords="5,112,56,137"/>
|
||||
<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
|
||||
<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,109,67,82,102,55,111,50,114,55,105,60,71,86,45,113"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="173,70,244,96"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,116,158,92,159,97,57,121"/>
|
||||
<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
|
||||
<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,127,109,139,108,144,56,132"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="45,136,71,164,105,194,151,223,149,228,102,198,68,168,41,139"/>
|
||||
<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="175,144,173,134,179,125,191,119,209,117,228,120,240,126,237,131,227,125,209,123,192,125,182,129,178,135,180,143"/>
|
||||
<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="175,233,173,223,179,214,191,209,209,207,228,209,240,215,237,220,227,214,209,212,192,214,182,218,178,224,180,232"/>
|
||||
|
||||
@@ -1 +1 @@
|
||||
8ff9455b3c103bbf869010f5c5b8fefb
|
||||
1b5ce80b47cd8b7f1d354d18b309e180
|
||||
@@ -31,7 +31,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
|
||||
<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -68,7 +68,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
|
||||
<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -87,7 +87,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
|
||||
<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 7.5 KiB After Width: | Height: | Size: 7.5 KiB |
@@ -20,7 +20,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
|
||||
<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -57,7 +57,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
|
||||
<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -76,7 +76,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
|
||||
<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 6.7 KiB After Width: | Height: | Size: 6.7 KiB |
@@ -9,11 +9,11 @@
|
||||
<area shape="rect" id="Node000009" href="$dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title="3rd test-case" alt="" coords="104,155,154,180"/>
|
||||
<area shape="poly" id="edge15_Node000001_Node000009" title=" " alt="" coords="51,106,100,143,97,147,48,110"/>
|
||||
<area shape="poly" id="edge4_Node000003_Node000002" title=" " alt="" coords="154,57,201,41,256,27,257,32,203,46,155,62"/>
|
||||
<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="202,55,412,96"/>
|
||||
<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="202,55,412,96"/>
|
||||
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="155,67,187,68,187,74,154,72"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="222,144,392,185"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="222,144,392,185"/>
|
||||
<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="156,80,256,134,253,139,153,85"/>
|
||||
<area shape="rect" id="Node000006" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="226,234,389,274"/>
|
||||
<area shape="rect" id="Node000006" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="226,234,389,274"/>
|
||||
<area shape="poly" id="edge7_Node000003_Node000006" title=" " alt="" coords="147,81,156,91,171,121,178,146,186,170,204,195,242,224,238,228,200,199,182,172,173,147,166,122,152,94,143,84"/>
|
||||
<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="273,144,271,135,277,126,289,120,307,118,327,120,338,127,336,131,325,125,307,123,290,125,280,130,277,136,278,143"/>
|
||||
<area shape="poly" id="edge8_Node000006_Node000006" title=" " alt="" coords="273,234,271,224,277,215,289,209,307,207,327,210,338,216,336,221,325,215,307,212,290,214,280,219,277,225,278,233"/>
|
||||
|
||||
@@ -1 +1 @@
|
||||
b04e038c7f1c7786c2d04a2a6b0ff779
|
||||
d7adf2d125e93032f623b2d5accdde46
|
||||
@@ -112,7 +112,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="305.25,-164.5 147.5,-164.5 147.5,-134 305.25,-134 305.25,-164.5"/>
|
||||
<text text-anchor="start" x="155.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="226.38" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -131,7 +131,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="290.25,-97.5 162.5,-97.5 162.5,-67 290.25,-67 290.25,-97.5"/>
|
||||
<text text-anchor="start" x="170.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="226.38" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -150,7 +150,7 @@
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="287.62,-30.5 165.12,-30.5 165.12,0 287.62,0 287.62,-30.5"/>
|
||||
<text text-anchor="start" x="173.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="226.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 14 KiB After Width: | Height: | Size: 14 KiB |
@@ -101,7 +101,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="305.25,-164.5 147.5,-164.5 147.5,-134 305.25,-134 305.25,-164.5"/>
|
||||
<text text-anchor="start" x="155.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="226.38" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -120,7 +120,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="290.25,-97.5 162.5,-97.5 162.5,-67 290.25,-67 290.25,-97.5"/>
|
||||
<text text-anchor="start" x="170.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="226.38" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -139,7 +139,7 @@
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="287.62,-30.5 165.12,-30.5 165.12,0 287.62,0 287.62,-30.5"/>
|
||||
<text text-anchor="start" x="173.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="226.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 13 KiB After Width: | Height: | Size: 13 KiB |
@@ -1,12 +1,12 @@
|
||||
<map id="test3" name="test3">
|
||||
<area shape="rect" id="Node000001" title="3rd test-case" alt="" coords="5,112,56,137"/>
|
||||
<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
|
||||
<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,109,67,82,102,55,111,50,114,55,105,60,71,86,45,113"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="173,70,244,96"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,116,158,92,159,97,57,121"/>
|
||||
<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
|
||||
<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,127,109,139,108,144,56,132"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="45,136,71,164,105,194,151,223,149,228,102,198,68,168,41,139"/>
|
||||
<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="175,144,173,134,179,125,191,119,209,117,228,120,240,126,237,131,227,125,209,123,192,125,182,129,178,135,180,143"/>
|
||||
<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="175,233,173,223,179,214,191,209,209,207,228,209,240,215,237,220,227,214,209,212,192,214,182,218,178,224,180,232"/>
|
||||
|
||||
@@ -1 +1 @@
|
||||
8ea68ec079c1fb7f486fff24ad6a0b99
|
||||
17089c21be1c8ab9e9937872bbc0da11
|
||||
@@ -31,7 +31,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
|
||||
<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -68,7 +68,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
|
||||
<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -87,7 +87,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
|
||||
<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 7.5 KiB After Width: | Height: | Size: 7.5 KiB |
@@ -20,7 +20,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
|
||||
<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -57,7 +57,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
|
||||
<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -76,7 +76,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
|
||||
<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 6.7 KiB After Width: | Height: | Size: 6.7 KiB |
@@ -11,11 +11,11 @@
|
||||
<area shape="rect" id="Node000010" href="$dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title="3rd test-case" alt="" coords="201,155,251,180"/>
|
||||
<area shape="poly" id="edge16_Node000002_Node000010" title=" " alt="" coords="148,106,197,143,194,147,145,110"/>
|
||||
<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="251,57,299,41,353,27,354,32,300,46,253,62"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="299,55,510,96"/>
|
||||
<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="299,55,510,96"/>
|
||||
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="252,67,284,68,284,74,252,72"/>
|
||||
<area shape="rect" id="Node000006" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="319,144,490,185"/>
|
||||
<area shape="rect" id="Node000006" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="319,144,490,185"/>
|
||||
<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="253,80,353,134,350,139,251,85"/>
|
||||
<area shape="rect" id="Node000007" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="323,234,486,274"/>
|
||||
<area shape="rect" id="Node000007" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="323,234,486,274"/>
|
||||
<area shape="poly" id="edge8_Node000004_Node000007" title=" " alt="" coords="245,81,254,91,269,121,276,146,284,170,301,195,339,224,336,228,297,199,279,172,271,147,264,122,249,94,240,84"/>
|
||||
<area shape="poly" id="edge7_Node000006_Node000006" title=" " alt="" coords="370,144,369,135,374,126,386,120,405,118,424,120,436,127,433,131,422,125,404,123,388,125,378,130,374,136,376,143"/>
|
||||
<area shape="poly" id="edge9_Node000007_Node000007" title=" " alt="" coords="370,234,369,224,374,215,386,209,405,207,424,210,436,216,433,221,422,215,404,212,388,214,378,219,374,225,376,233"/>
|
||||
|
||||
@@ -1 +1 @@
|
||||
c321b22c372c70b212591c4f6e6a111f
|
||||
6eae5e53b0353c094f1a38ef294ecd52
|
||||
@@ -166,7 +166,7 @@ var sectionId = 'dynsection-1';
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="378.25,-164.5 220.5,-164.5 220.5,-134 378.25,-134 378.25,-164.5"/>
|
||||
<text text-anchor="start" x="228.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="299.38" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -185,7 +185,7 @@ var sectionId = 'dynsection-1';
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="363.25,-97.5 235.5,-97.5 235.5,-67 363.25,-67 363.25,-97.5"/>
|
||||
<text text-anchor="start" x="243.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="299.38" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -204,7 +204,7 @@ var sectionId = 'dynsection-1';
|
||||
<!-- Node7 -->
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000007"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="360.62,-30.5 238.12,-30.5 238.12,0 360.62,0 360.62,-30.5"/>
|
||||
<text text-anchor="start" x="246.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="299.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 18 KiB After Width: | Height: | Size: 18 KiB |
@@ -119,7 +119,7 @@
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
|
||||
<polygon fill="white" stroke="#666666" points="378.25,-164.5 220.5,-164.5 220.5,-134 378.25,-134 378.25,-164.5"/>
|
||||
<text text-anchor="start" x="228.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="299.38" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
|
||||
@@ -138,7 +138,7 @@
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
|
||||
<polygon fill="white" stroke="#666666" points="363.25,-97.5 235.5,-97.5 235.5,-67 363.25,-67 363.25,-97.5"/>
|
||||
<text text-anchor="start" x="243.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="299.38" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
|
||||
@@ -157,7 +157,7 @@
|
||||
<!-- Node7 -->
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<g id="a_Node000007"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
|
||||
<polygon fill="white" stroke="#666666" points="360.62,-30.5 238.12,-30.5 238.12,0 360.62,0 360.62,-30.5"/>
|
||||
<text text-anchor="start" x="246.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
|
||||
<text text-anchor="middle" x="299.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 14 KiB After Width: | Height: | Size: 14 KiB |
Reference in New Issue
Block a user