mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-23 05:12:40 +08:00
Documentation for c26eea874d
This commit is contained in:
realstealthninja
@@ -4,7 +4,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.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: others/iterative_tree_traversals.cpp Source File</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -124,23 +124,23 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="headertitle"><div class="title">iterative_tree_traversals.cpp</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<a href="../../d8/d90/iterative__tree__traversals_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
|
||||
<a href="../../d8/d90/iterative__tree__traversals_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#include <algorithm></span> </div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include <cassert></span> </div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="preprocessor">#include <iostream></span> </div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#include <stack></span> </div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include <vector></span> </div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span></div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d73/namespaceiterative__tree__traversals.html">iterative_tree_traversals</a> {</div>
|
||||
<div class="foldopen" id="foldopen00058" data-start="{" data-end="};">
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html"> 58</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> {</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f"> 59</a></span> int64_t <a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">data</a> = 0; </div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e"> 60</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *left{}; </div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e"> 60</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>{}; </div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143"> 61</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>{}; </div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span>};</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span></div>
|
||||
<div class="foldopen" id="foldopen00067" data-start="{" data-end="};">
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html"> 67</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">BinaryTree</a> {</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">public</span>:</div>
|
||||
@@ -154,20 +154,20 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *); </div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span>};</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span></div>
|
||||
<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6"> 88</a></span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">BinaryTree::createNewNode</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a>();</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span></div>
|
||||
<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae"> 102</a></span>std::vector<int64_t> <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">BinaryTree::preOrderIterative</a>(<a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *root) {</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> std::stack<Node *></div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>; </div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>; </div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> std::vector<int64_t> result; </div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
|
||||
@@ -188,11 +188,11 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">return</span> result;</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span></div>
|
||||
<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25"> 132</a></span>std::vector<int64_t> <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">BinaryTree::postOrderIterative</a>(<a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *root) {</div>
|
||||
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> std::stack<Node *></div>
|
||||
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>; </div>
|
||||
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>; </div>
|
||||
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> std::vector<int64_t> result; </div>
|
||||
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> </div>
|
||||
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
|
||||
@@ -215,11 +215,11 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">return</span> result;</div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
|
||||
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span></div>
|
||||
<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499"> 164</a></span>std::vector<int64_t> <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">BinaryTree::inOrderIterative</a>(<a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *root) {</div>
|
||||
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> std::stack<Node *></div>
|
||||
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>; </div>
|
||||
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>; </div>
|
||||
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> std::vector<int64_t> result; </div>
|
||||
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> </div>
|
||||
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *current = root;</div>
|
||||
@@ -239,7 +239,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
</div>
|
||||
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span><span class="keywordtype">void</span> deleteAll(<a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *root) {</div>
|
||||
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="keywordflow">if</span> (root) {</div>
|
||||
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> std::stack<Node *> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
|
||||
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> std::stack<Node *> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>;</div>
|
||||
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
|
||||
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> </div>
|
||||
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
|
||||
@@ -258,7 +258,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span>}</div>
|
||||
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span>} <span class="comment">// namespace iterative_tree_traversals</span></div>
|
||||
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span>} <span class="comment">// namespace others</span></div>
|
||||
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> </div>
|
||||
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span></div>
|
||||
<div class="foldopen" id="foldopen00210" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0"> 210</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
|
||||
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
|
||||
@@ -282,7 +282,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> }</div>
|
||||
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> </div>
|
||||
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span></div>
|
||||
<div class="foldopen" id="foldopen00237" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21"> 237</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
|
||||
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
|
||||
@@ -306,7 +306,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> }</div>
|
||||
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> </div>
|
||||
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span></div>
|
||||
<div class="foldopen" id="foldopen00264" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4"> 264</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
|
||||
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
|
||||
@@ -330,7 +330,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> }</div>
|
||||
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> </div>
|
||||
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span></div>
|
||||
<div class="foldopen" id="foldopen00291" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2"> 291</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
|
||||
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
|
||||
@@ -354,7 +354,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> }</div>
|
||||
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> </div>
|
||||
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span></div>
|
||||
<div class="foldopen" id="foldopen00319" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8"> 319</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
|
||||
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
|
||||
@@ -378,7 +378,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> }</div>
|
||||
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> </div>
|
||||
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span></div>
|
||||
<div class="foldopen" id="foldopen00346" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89"> 346</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
|
||||
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
|
||||
@@ -402,7 +402,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> }</div>
|
||||
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> </div>
|
||||
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span></div>
|
||||
<div class="foldopen" id="foldopen00372" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 372</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="comment">// Creating a tree with the following structure,</span></div>
|
||||
@@ -417,10 +417,10 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></div>
|
||||
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> binaryTree; </div>
|
||||
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(1);</div>
|
||||
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> root->left = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(2);</div>
|
||||
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> root->right = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(3);</div>
|
||||
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> root->left->left = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(4);</div>
|
||||
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> root->left->right = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(5);</div>
|
||||
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> root-><a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a> = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(2);</div>
|
||||
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> root-><a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a> = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(3);</div>
|
||||
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> root-><a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>-><a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a> = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(4);</div>
|
||||
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> root-><a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>-><a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a> = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(5);</div>
|
||||
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> </div>
|
||||
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> std::cout << <span class="stringliteral">"\n| Tests for positive data value |"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(binaryTree, root); <span class="comment">// run preorder-iterative test</span></div>
|
||||
@@ -454,7 +454,6 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span>}</div>
|
||||
</div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</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> <a href="#l00067">iterative_tree_traversals.cpp:67</a></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> <a href="#l00164">iterative_tree_traversals.cpp:164</a></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> <a href="#l00088">iterative_tree_traversals.cpp:88</a></div></div>
|
||||
@@ -474,7 +473,6 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<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> <a href="#l00346">iterative_tree_traversals.cpp:346</a></div></div>
|
||||
<div class="ttc" id="anamespaceiterative__tree__traversals_html"><div class="ttname"><a href="../../dd/d73/namespaceiterative__tree__traversals.html">iterative_tree_traversals</a></div><div class="ttdoc">Functions for the Traversal of the Tree algorithm.</div></div>
|
||||
<div class="ttc" id="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
|
||||
<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
|
||||
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
|
||||
<div class="ttc" id="astructothers_1_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> <a href="#l00058">iterative_tree_traversals.cpp:58</a></div></div>
|
||||
<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html_a1dbaeff928e469a05251879568515b8e"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">others::iterative_tree_traversals::Node::left</a></div><div class="ttdeci">struct Node * left</div><div class="ttdoc">struct pointer to left subtree.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">iterative_tree_traversals.cpp:60</a></div></div>
|
||||
@@ -486,7 +484,7 @@ $(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','
|
||||
<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.12.0 </li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user