mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-25 11:03:23 +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++: operations_on_datastructures/inorder_successor_of_bst.cpp File Reference</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');
|
||||
@@ -248,11 +248,12 @@ Method 2: Search from the root node</h4>
|
||||
<div class="line"><span class="lineno"> 211</span> <span class="keywordflow">if</span> (rootNode == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 212</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 213</span> }</div>
|
||||
<div class="line"><span class="lineno"> 214</span> <a class="code hl_function" href="#a7b20eb99272665c1777949e26ab59589">deallocate</a>(rootNode->left);</div>
|
||||
<div class="line"><span class="lineno"> 215</span> <a class="code hl_function" href="#a7b20eb99272665c1777949e26ab59589">deallocate</a>(rootNode->right);</div>
|
||||
<div class="line"><span class="lineno"> 214</span> deallocate(rootNode-><a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">left</a>);</div>
|
||||
<div class="line"><span class="lineno"> 215</span> deallocate(rootNode-><a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a>);</div>
|
||||
<div class="line"><span class="lineno"> 216</span> <span class="keyword">delete</span> (rootNode);</div>
|
||||
<div class="line"><span class="lineno"> 217</span>}</div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00210">inorder_successor_of_bst.cpp:210</a></div></div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_a9b4ae6f5179a1c8ecfd563811a59e6c0"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">operations_on_datastructures::inorder_traversal_of_bst::Node::right</a></div><div class="ttdeci">Node * right</div><div class="ttdoc">Pointer to right child.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00060">inorder_successor_of_bst.cpp:60</a></div></div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_a9ccef4c746b7226488b014f5bac4789a"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">operations_on_datastructures::inorder_traversal_of_bst::Node::left</a></div><div class="ttdeci">Node * left</div><div class="ttdoc">Pointer to Left child.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00059">inorder_successor_of_bst.cpp:59</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -324,14 +325,14 @@ Method 2: Search from the root node</h4>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00176">176</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 176</span> {</div>
|
||||
<div class="line"><span class="lineno"> 177</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *current = <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
|
||||
<div class="line"><span class="lineno"> 177</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *current = <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
|
||||
<div class="line"><span class="lineno"> 178</span> <span class="keywordflow">if</span> (current == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 179</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><span class="lineno"> 180</span> }</div>
|
||||
<div class="line"><span class="lineno"> 181</span> </div>
|
||||
<div class="line"><span class="lineno"> 182</span> <span class="comment">// Case - 1</span></div>
|
||||
<div class="line"><span class="lineno"> 183</span> <span class="keywordflow">if</span> (current->right != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 184</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a72483e3f6933e004a8d86371e8a990db">findMinNode</a>(current->right);</div>
|
||||
<div class="line"><span class="lineno"> 183</span> <span class="keywordflow">if</span> (current-><a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a> != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 184</span> <span class="keywordflow">return</span> findMinNode(current-><a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a>);</div>
|
||||
<div class="line"><span class="lineno"> 185</span> }</div>
|
||||
<div class="line"><span class="lineno"> 186</span> <span class="comment">// case - 2</span></div>
|
||||
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">else</span> {</div>
|
||||
@@ -340,7 +341,7 @@ Method 2: Search from the root node</h4>
|
||||
<div class="line"><span class="lineno"> 190</span> </div>
|
||||
<div class="line"><span class="lineno"> 191</span> <span class="keywordflow">while</span> (ancestor != current && ancestor != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 192</span> <span class="comment">// This means my current node is in left of the root node</span></div>
|
||||
<div class="line"><span class="lineno"> 193</span> <span class="keywordflow">if</span> (current->data < ancestor->data) {</div>
|
||||
<div class="line"><span class="lineno"> 193</span> <span class="keywordflow">if</span> (current-><a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> < ancestor->data) {</div>
|
||||
<div class="line"><span class="lineno"> 194</span> successor = ancestor;</div>
|
||||
<div class="line"><span class="lineno"> 195</span> ancestor = ancestor->left; <span class="comment">// keep going left</span></div>
|
||||
<div class="line"><span class="lineno"> 196</span> } <span class="keywordflow">else</span> {</div>
|
||||
@@ -350,8 +351,9 @@ Method 2: Search from the root node</h4>
|
||||
<div class="line"><span class="lineno"> 200</span> <span class="keywordflow">return</span> successor; <span class="comment">// Nodes with maximum vales will not have a successor</span></div>
|
||||
<div class="line"><span class="lineno"> 201</span> }</div>
|
||||
<div class="line"><span class="lineno"> 202</span>}</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00056">inorder_successor_of_bst.cpp:56</a></div></div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00058">inorder_successor_of_bst.cpp:58</a></div></div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a72483e3f6933e004a8d86371e8a990db"><div class="ttname"><a href="#a72483e3f6933e004a8d86371e8a990db">operations_on_datastructures::inorder_traversal_of_bst::findMinNode</a></div><div class="ttdeci">Node * findMinNode(Node *root)</div><div class="ttdoc">Finds and return the minimum node in BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00121">inorder_successor_of_bst.cpp:121</a></div></div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a824cbf1814854824cf05f062eea07b95"><div class="ttname"><a href="#a824cbf1814854824cf05f062eea07b95">operations_on_datastructures::inorder_traversal_of_bst::getNode</a></div><div class="ttdeci">Node * getNode(Node *root, int64_t data)</div><div class="ttdoc">Searches the given data in BST and returns the pointer to the node containing that data.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00100">inorder_successor_of_bst.cpp:100</a></div></div>
|
||||
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
@@ -396,7 +398,7 @@ Method 2: Search from the root node</h4>
|
||||
<div class="line"><span class="lineno"> 103</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (root->data == <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> root; </div>
|
||||
<div class="line"><span class="lineno"> 105</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> > root->data) {</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root->right, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">return</span> getNode(root->right, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
|
||||
<div class="line"><span class="lineno"> 109</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root->left, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
|
||||
<div class="line"><span class="lineno"> 113</span> }</div>
|
||||
@@ -444,7 +446,7 @@ Method 2: Search from the root node</h4>
|
||||
<div class="line"><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">return</span> root;</div>
|
||||
<div class="line"><span class="lineno"> 91</span>}</div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7f6f73a33beec448c27cc1d70b220702"><div class="ttname"><a href="#a7f6f73a33beec448c27cc1d70b220702">operations_on_datastructures::inorder_traversal_of_bst::makeNode</a></div><div class="ttdeci">Node * makeNode(int64_t data)</div><div class="ttdoc">Allocates a new node in heap for given data and returns it's pointer.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00068">inorder_successor_of_bst.cpp:68</a></div></div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7f6f73a33beec448c27cc1d70b220702"><div class="ttname"><a href="#a7f6f73a33beec448c27cc1d70b220702">operations_on_datastructures::inorder_traversal_of_bst::makeNode</a></div><div class="ttdeci">Node * makeNode(int64_t data)</div><div class="ttdoc">Allocates a new node in heap for given data and returns it's pointer.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00068">inorder_successor_of_bst.cpp:68</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -515,10 +517,9 @@ Method 2: Search from the root node</h4>
|
||||
<div class="line"><span class="lineno"> 427</span> </div>
|
||||
<div class="line"><span class="lineno"> 428</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 429</span>}</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00056">inorder_successor_of_bst.cpp:56</a></div></div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00058">inorder_successor_of_bst.cpp:58</a></div></div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a05fe8a029e155c43e4efa598d4d089d9"><div class="ttname"><a href="#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector< int64_t > &data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00155">inorder_successor_of_bst.cpp:155</a></div></div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00136">inorder_successor_of_bst.cpp:136</a></div></div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00210">inorder_successor_of_bst.cpp:210</a></div></div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00387">inorder_successor_of_bst.cpp:387</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -555,10 +556,11 @@ Method 2: Search from the root node</h4>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00155">155</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 155</span> {</div>
|
||||
<div class="line"><span class="lineno"> 156</span> <span class="keywordflow">for</span> (int64_t values : <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 157</span> root = Insert(root, values);</div>
|
||||
<div class="line"><span class="lineno"> 157</span> root = <a class="code hl_function" href="#a3ae0bea4123fd2ce155108e88f2ef78c">Insert</a>(root, values);</div>
|
||||
<div class="line"><span class="lineno"> 158</span> }</div>
|
||||
<div class="line"><span class="lineno"> 159</span> <span class="keywordflow">return</span> root;</div>
|
||||
<div class="line"><span class="lineno"> 160</span>}</div>
|
||||
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a3ae0bea4123fd2ce155108e88f2ef78c"><div class="ttname"><a href="#a3ae0bea4123fd2ce155108e88f2ef78c">operations_on_datastructures::inorder_traversal_of_bst::Insert</a></div><div class="ttdeci">Node * Insert(Node *root, int64_t data)</div><div class="ttdoc">Inserts the given data in BST while maintaining the properties of BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00082">inorder_successor_of_bst.cpp:82</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -591,13 +593,12 @@ Method 2: Search from the root node</h4>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 68</span> {</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>();</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_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_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a>();</div>
|
||||
<div class="line"><span class="lineno"> 70</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"><span class="lineno"> 71</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left = <span class="keyword">nullptr</span>; </div>
|
||||
<div class="line"><span class="lineno"> 72</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right = <span class="keyword">nullptr</span>; </div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
|
||||
<div class="line"><span class="lineno"> 74</span>}</div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</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><!-- fragment -->
|
||||
</div>
|
||||
@@ -634,9 +635,9 @@ Method 2: Search from the root node</h4>
|
||||
<div class="line"><span class="lineno"> 138</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 139</span> }</div>
|
||||
<div class="line"><span class="lineno"> 140</span> </div>
|
||||
<div class="line"><span class="lineno"> 141</span> <a class="code hl_function" href="#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root->left); </div>
|
||||
<div class="line"><span class="lineno"> 141</span> printInorder(root->left); </div>
|
||||
<div class="line"><span class="lineno"> 142</span> std::cout << root->data << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 143</span> <a class="code hl_function" href="#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root->right); </div>
|
||||
<div class="line"><span class="lineno"> 143</span> printInorder(root->right); </div>
|
||||
<div class="line"><span class="lineno"> 144</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -659,7 +660,7 @@ Method 2: Search from the root node</h4>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -683,7 +684,7 @@ Method 2: Search from the root node</h4>
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.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