mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 22:32:24 +08:00
Documentation for 0953376d31
This commit is contained in:
github-actions
@@ -3,7 +3,7 @@
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.9.6"/>
|
||||
<meta name="generator" content="Doxygen 1.9.7"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: others/iterative_tree_traversals.cpp File Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.6 -->
|
||||
<!-- Generated by Doxygen 1.9.7 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -115,8 +115,7 @@ $(document).ready(function(){initNavTree('d8/d90/iterative__tree__traversals_8cp
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for iterative_tree_traversals.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d94/iterative__tree__traversals_8cpp__incl.svg" width="428" 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="../../de/d94/iterative__tree__traversals_8cpp__incl.svg" width="428" 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>
|
||||
@@ -242,22 +241,21 @@ Iterative Inorder Traversal of a tree</h3>
|
||||
<div class="line"><span class="lineno"> 399</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 400</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_1iterative__tree__traversals_1_1_binary_tree_html"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></div><div class="ttdoc">defines the functions associated with the binary tree</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:67</div></div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a3078a5ccf45d6a7031dcf46e43de65b6"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">others::iterative_tree_traversals::BinaryTree::createNewNode</a></div><div class="ttdeci">Node * createNewNode(int64_t)</div><div class="ttdoc">function that will create new node for insertion.</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:88</div></div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></div><div class="ttdoc">defines the functions associated with the binary tree</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:67</div></div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a3078a5ccf45d6a7031dcf46e43de65b6"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">others::iterative_tree_traversals::BinaryTree::createNewNode</a></div><div class="ttdeci">Node * createNewNode(int64_t)</div><div class="ttdoc">function that will create new node for insertion.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:88</div></div>
|
||||
<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/data.html">std::vector::data</a></div><div class="ttdeci">T data(T... args)</div></div>
|
||||
<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:186</div></div>
|
||||
<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:169</div></div>
|
||||
<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:186</div></div>
|
||||
<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:169</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="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:122</div></div>
|
||||
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_a038b236fe900f7bb7e57164f5bed66c2"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a></div><div class="ttdeci">static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed preorder with the actual preorder on negative value.</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:272</div></div>
|
||||
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_aa9ef334cd7eb607f4eb8732566ea00b8"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a></div><div class="ttdeci">static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed postorder with the actual postorder on negative value.</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:300</div></div>
|
||||
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_af727f920064f2b8f484b589b60d49b89"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a></div><div class="ttdeci">static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed inorder with the actual inorder on negative value.</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:327</div></div>
|
||||
<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a></div><div class="ttdoc">defines the structure of a node of the tree</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:58</div></div>
|
||||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> hamiltons_cycle.cpp:122</div></div>
|
||||
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_a038b236fe900f7bb7e57164f5bed66c2"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a></div><div class="ttdeci">static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed preorder with the actual preorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:272</div></div>
|
||||
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_aa9ef334cd7eb607f4eb8732566ea00b8"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a></div><div class="ttdeci">static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed postorder with the actual postorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:300</div></div>
|
||||
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_af727f920064f2b8f484b589b60d49b89"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a></div><div class="ttdeci">static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed inorder with the actual inorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:327</div></div>
|
||||
<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a></div><div class="ttdoc">defines the structure of a node of the tree</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:58</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
@@ -321,18 +319,17 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 205</span> </div>
|
||||
<div class="line"><span class="lineno"> 206</span> <span class="comment">// Printing the result storing preorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 207</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">"\nPreOrder Traversal Is : "</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"> 208</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
|
||||
<div class="line"><span class="lineno"> 208</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 209</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 210</span> }</div>
|
||||
<div class="line"><span class="lineno"> 211</span>}</div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_ad4c6a8e67fb8267a65439b035666b5ae"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">others::iterative_tree_traversals::BinaryTree::preOrderIterative</a></div><div class="ttdeci">std::vector< int64_t > preOrderIterative(Node *)</div><div class="ttdoc">preOrderIterative() function that will perform the preorder traversal iteratively,...</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:102</div></div>
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_ad4c6a8e67fb8267a65439b035666b5ae"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">others::iterative_tree_traversals::BinaryTree::preOrderIterative</a></div><div class="ttdeci">std::vector< int64_t > preOrderIterative(Node *)</div><div class="ttdoc">preOrderIterative() function that will perform the preorder traversal iteratively,...</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:102</div></div>
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:76</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>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
@@ -396,16 +393,15 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 232</span> </div>
|
||||
<div class="line"><span class="lineno"> 233</span> <span class="comment">// Printing the result storing postorder.</span></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">"\nPostOrder Traversal Is : "</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"> 235</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
|
||||
<div class="line"><span class="lineno"> 235</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>) {</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> << i << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 237</span> }</div>
|
||||
<div class="line"><span class="lineno"> 238</span>}</div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a636a07c90b7f312bb86d2ec104efca25"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">others::iterative_tree_traversals::BinaryTree::postOrderIterative</a></div><div class="ttdeci">std::vector< int64_t > postOrderIterative(Node *)</div><div class="ttdoc">postOrderIterative() function that will perform the postorder traversal iteratively,...</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:132</div></div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a636a07c90b7f312bb86d2ec104efca25"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">others::iterative_tree_traversals::BinaryTree::postOrderIterative</a></div><div class="ttdeci">std::vector< int64_t > postOrderIterative(Node *)</div><div class="ttdoc">postOrderIterative() function that will perform the postorder traversal iteratively,...</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:132</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
@@ -469,16 +465,15 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 259</span> </div>
|
||||
<div class="line"><span class="lineno"> 260</span> <span class="comment">// Printing the result storing inorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 261</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">"\nInOrder Traversal Is : "</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"> 262</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
|
||||
<div class="line"><span class="lineno"> 262</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 263</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 264</span> }</div>
|
||||
<div class="line"><span class="lineno"> 265</span>}</div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a0c33f2c1a3a3deb486a1c33ee5239499"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree::inOrderIterative</a></div><div class="ttdeci">std::vector< int64_t > inOrderIterative(Node *)</div><div class="ttdoc">inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...</div><div class="ttdef"><b>Definition:</b> iterative_tree_traversals.cpp:164</div></div>
|
||||
<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a0c33f2c1a3a3deb486a1c33ee5239499"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree::inOrderIterative</a></div><div class="ttdeci">std::vector< int64_t > inOrderIterative(Node *)</div><div class="ttdoc">inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:164</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
@@ -542,15 +537,14 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 286</span> </div>
|
||||
<div class="line"><span class="lineno"> 287</span> <span class="comment">// Printing the result storing preorder.</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">"\nPreOrder Traversal Is : "</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> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
|
||||
<div class="line"><span class="lineno"> 289</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 290</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 291</span> }</div>
|
||||
<div class="line"><span class="lineno"> 292</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
@@ -614,15 +608,14 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 314</span> </div>
|
||||
<div class="line"><span class="lineno"> 315</span> <span class="comment">// Printing the result storing postorder.</span></div>
|
||||
<div class="line"><span class="lineno"> 316</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">"\nPostOrder Traversal Is : "</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"> 317</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
|
||||
<div class="line"><span class="lineno"> 317</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 318</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 319</span> }</div>
|
||||
<div class="line"><span class="lineno"> 320</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
@@ -686,15 +679,14 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 341</span> </div>
|
||||
<div class="line"><span class="lineno"> 342</span> <span class="comment">// Printing the result storing inorder.</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">"\nInOrder Traversal Is : "</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> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
|
||||
<div class="line"><span class="lineno"> 344</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 345</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 346</span> }</div>
|
||||
<div class="line"><span class="lineno"> 347</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.svg" width="403" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
@@ -705,7 +697,7 @@ Here is the call graph for this function:</div>
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html">iterative_tree_traversals.cpp</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user